We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 10: Binary Numbers
  5. Discussions

Day 10: Binary Numbers

  • rcgonzalezf
     + 17 comments

    The same solution with better names:

    Scanner in = new Scanner(System.in);
int n = in.nextInt();
int counter = 0, max =0;
while (n > 0) {
    int rem = n%2;
    if (rem==1) counter++; 
    else counter=0;
    max = Math.max(counter, max);
    n/=2;
}
System.out.println(max);