Posts Tagged 【bit】Bitwise AND of Numbers Range

Bitwise AND of Numbers Range

  Total Accepted: 5165  Total Submissions: 19617 My Submissions

Question  Solution 

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.

/*
问题的关键是明白【公共头部分】
101、110、111中间有0出现则为0
求两者公共的头部分
n&(n-1)将右起的1依次置为0 
n=xxxx1000
n-1=xxxx0111
n&n-1=xxxx0000
当然也可以，移位慢慢比较直到两者相等
也就是到达公共头部分
头部分的大小+补位【归位】就是answer
*/
public class Solution {
    public int rangeBitwiseAnd(int m, int n) {
        while(n>m) 
            n = n&(n-1);
        return m&n;
    }
}

Have you met this question in a real interview?