Binary Gap

class Solution {
    public int solution(int N) {
        // write your code in Java SE 8
        boolean flag = false;
        int len = 0, max_len = 0;
        
        while(N > 0) {
            int binary = N % 2;
            if (binary == 1) {
                if (!flag) {
                    flag = true;
                } 
                else {
                    //뒤쪽의 1을 만남 
                    max_len = max_len < len ? len : max_len;
                    len = 0;
                }
            }
            else {
                if (flag) len++;
            }
            N /= 2;
            
        }
        
        
        return max_len;
    }
}