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.
Credits:
Special thanks to @amrsaqr for adding this problem and creating all test cases.
实现:
class Solution {
public:
int rangeBitwiseAnd(int m, int n) {
unsigned int x = m ^ n;
x |= x >> 1, x |= x >> 2, x |= x >> 4, x |= x >> 8, x |= x >> 16;
return m & ~x;
}
};
本篇介绍了一个算法问题:给定一个范围[m,n](0<=m<=n<=2147483647),返回该范围内所有数的按位与结果。例如,对于范围[5,7],返回值应为4。文章提供了具体的实现代码。

3873

被折叠的 条评论
为什么被折叠?



