Bitwise AND of Numbers Range | Leetcode

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.

---

Solution: A trick question. See http://yucoding.blogspot.com/2015/06/leetcode-question-bitwise-and-of.html for a good explanation.

public class Solution {
    public int rangeBitwiseAnd(int m, int n) {
        int pos = 0;
        while (m < n) {
            pos++;
            m >>= 1;
            n >>= 1;
        }
        return m << pos;
    }
}