LeetCode(23), Bitwise AND of Numbers Range

Description

Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.

Example 1:

Input: [5,7]
Output: 4

Example 2:

Input: [0,1]
Output: 0

Solution

The idea is very simple:

1. last bit of (odd number & even number) is 0.
2. when m != n, There is at least an odd number and an even number, so the last bit position result is 0.
3. Move m and n right a position.

Keep doing step 1,2,3 until m equal to n, use a factor to record the iteration time.

class Solution {
    public int rangeBitwiseAnd(int m, int n) {
        if (m == 0) return 0;
        
        int moveFactor = 1;
        while (m != n) {
            m = m >> 1;
            n = n >> 1;
            moveFactor = moveFactor << 1;
        }
        return m * moveFactor;
    }
}