Find the longest sequence of zeros in binary representation of an integer.

BinaryGap.java

public class BinaryGap {
	
	public int solution(int N) {
		int max = 0;
		int counter = 0;
		boolean isCounting = false;
		
		while(N > 0) {
			if((N & 1) == 1) {
				if(isCounting) {
					max = Math.max(max, counter);
					counter = 0;
				} else {
					isCounting = true;
					counter = 0;
				}
			} else {
				if(isCounting) {
					counter++;
				}
			}
			N >>= 1;
		}
		return max;
	}
}