[2018.12.21] Binary Numbers

Problem

Objective 
Today, we're working with binary numbers. Check out the Tutorial tab for learning materials and an instructional video!

Task 
Given a base- integer, , convert it to binary (base-). Then find and print the base- integer denoting the maximum number of consecutive 's in 's binary representation.

Input Format

A single integer, .

Constraints

Output Format

Print a single base- integer denoting the maximum number of consecutive 's in the binary representation of .

Sample Input 1

5

Sample Output 1

1

Sample Input 2

13

Sample Output 2

2

Explanation

Sample Case 1: 
The binary representation of  is , so the maximum number of consecutive 's is .

Sample Case 2: 
The binary representation of  is , so the maximum number of consecutive 's is .

How I solved the problem

#10진수를 계속 2로 나누어서 나온 나머지를 2진수로 바꿀 수 있음.

#연속된(consecutive) 1의 최대 개수를 찾는 것 이라서 compCount와 count 두개를 가지고 비교해야함!

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
 
public class Solution {
 
 
 
    private static final Scanner scanner = new Scanner(System.in);
 
    public static void main(String[] args) {
        int n = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
        int count = 0;
        int compCount = 0;
 
        while (n > 0) {
            if (n % 2 == 1) {
                compCount ++;
 
                if (count < compCount) {
                    count = compCount;
                }
            }  else if (n % 2 == 0) {
                compCount = 0;
            }
            n = n / 2;
        }
 
        if (count == 0) {
            count = compCount;
        }
 
        System.out.println(count);
        scanner.close();
    }
}
 

[출처 : https://www.hackerrank.com ]