[LeetCode]201. Bitwise AND of Numbers Range

https://leetcode.com/problems/bitwise-and-of-numbers-range/?tab=Description

求[beg, end]范围的取and结果

找beg和end的高相同的位即为结果

public class Solution { public int rangeBitwiseAnd(int m, int n) { int res = 0; for (int i = 31; i >= 0; i--) { if ((m & (1 << i)) != (n & (1 << i))) { break; } else { res |= (m & (1 << i)); } } return res; } }