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.
解题思路：
本题有很多思路，最简单的方法：
result就是m和n二进制前面相同的部分！！！
JAVA实现如下：
public int rangeBitwiseAnd(int m, int n) {
int count=0;
while(m!=n){
n>>>=1;
m>>>=1;
count++;
}
return m<<count;
}
Java for LeetCode 201 Bitwise AND of Numbers Range
原文：http://www.cnblogs.com/tonyluis/p/4558866.html