Monday, February 6, 2023
HomeSoftware DevelopmentDepend variety of 0's with given circumstances

# Depend variety of 0’s with given circumstances

Given a binary string (containing 1’s and 0’s), write a program to depend the variety of 0’s in a given string such that the next circumstances maintain:

• 1’s and 0’s are in any order in a string
• Use of conditional statements like if, if..else, and change are usually not allowed
• Use of  addition/subtraction is just not allowed

Examples:

Enter : S = “101101”
Output : 2

Enter : S = “00101111000”
Output : 6

Method: The above drawback may be solved with the beneath thought:

If counter and conditional statements are usually not allowed. We’re having choice of Error dealing with.

Steps concerned within the implementation of the strategy:

• Take a string and a static variable counter which keep the depend of zero.
• Traverse by means of every character and convert it into an integer.
• Take this quantity and use it as a denominator of the quantity “0”.
• Use the exception dealing with technique attempt..catch in a loop such that every time we acquired the Arithmetic exception, the counter will increment.
• Print the counter worth consequently.

Under is the implementation of the above strategy:

## Java

 `import` `java.io.*;` ` `  `class` `GFG {` ` `  `    ` `    ``public` `static` `int` `cnt = ``0``;` ` `  `    ``public` `static` `void` `primary(String[] args)` `    ``{` ` `  `        ``String s = ``"01001001110"``;` ` `  `        ` `        ``countZero(s);` `    ``}` ` `  `    ` `    ` `    ``static` `void` `countZero(String s)` `    ``{` ` `  `        ``for` `(``int` `i = ``0``; i < s.size(); i++) {` `            ``attempt` `{` `                ``int` `div = Character.getNumericValue(` `                    ``s.charAt(i));` `                ` `                ` `                ` `                ` `                ``int` `val = ``0` `/ div;` `            ``}` ` `  `            ` `            ``catch` `(Exception exception) {` `                ``cnt++;` `            ``}` `        ``}` ` `  `        ` `        ``System.out.println(cnt);` `    ``}` `}`

Time Complexity: O(N)
Auxiliary Area: O(1)

Associated Articles:

RELATED ARTICLES