Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.
For example, given the range [5, 7], you should return 4.
bitwise AND 的结果是left header, 因为如果某一位出现了0,他右边一位一定会出现0.
public class Solution {
public int rangeBitwiseAnd(int m, int n) {
int i=0;
while(m!=n)
{
m>>=1;
n>>=1;
i++;
}
return m<<i;
}
}