Write a Java program that will accept an integer and convert it into a binary representation. Now count the number of bits which is equal to zero of the said binary representation
Expected Output: Input first number: 25 Binary representation of 25 is: 11001 Number of zero bits: 2
import java.util.Scanner;
public class Solution {
public static int countBitsTozeroBasedOnString(int n) {
int ctr = 0;
String binaryNumber = Integer.toBinaryString(n);
System.out.print("Binary representation of "+n+" is: "+binaryNumber);
for (char ch : binaryNumber.toCharArray()) {
ctr += ch == '0' ? 1 : 0;
}
return ctr;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.print("Input first number: ");
int n = in.nextInt();
System.out.println("\nNumber of zero bits: " + countBitsTozeroBasedOnString(n));
}
}
Sample Output:
Input first number: 25
Binary representation of 25 is: 11001
Number of zero bits: 2s
Sample Output:
need an explanation for this answer? contact us directly to get an explanation for this answer