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.
Subscribe to see which companies asked this question
1 public class Solution { 2 public int rangeBitwiseAnd(int m, int n) { 3 int i = 0; 4 while(m != n){ 5 m >>= 1; 6 n >>= 1; 7 i++; 8 } 9 return (m << i); 10 } 11 }
时间: 2024-11-04 03:04:07