BinaryGap.java

class Solution {
    public int solution(int N) {
        int current = N;
        int max = 0;
        int currentGap = 0;
        boolean start = false;
        while (current / 2 != 0) {
            if (current % 2 != 0) {
                max = currentGap > max ? currentGap : max;
                currentGap = 0;
                start = true;
            } else if (start) {
                currentGap++;
            }
            current = current / 2;
        }
        if (currentGap > max) {
            max = currentGap;
        }
        return max;
    }
}