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.
分析了一下数据的格式,发现相差1时,最后一位为必为0,相差2时,最后第二位必为0。。。以此类推,以m和n的and值作为起始值进行运算
public class Solution {
public int rangeBitwiseAnd(int m, int n) {
if(m==n) return m;
if(n/2>=m) return 0;
int ans = n&m;
int diff = n - m;
int temp = 0xffffffff;
while(diff!=0){
temp <<= 1;
ans = ans & temp;
diff /= 2;
}
return ans;
}
}
别人的方法,位操作m和n
public class Solution {
public int rangeBitwiseAnd(int m, int n) {
if(m == 0){
return 0;
}
int moveFactor = 1;
while(m != n){
m >>= 1;
n >>= 1;
moveFactor <<= 1;
}
return m * moveFactor;
}
}