class Solution {
public:
int rangeBitwiseAnd(int m, int n) {
long long a = max(m, n);
long long b = min(m, n);
if (b == 0) {
return 0;
}
int ans = 0;
long long ha = 1, hb = 1;
while (ha <= a) {
ha <<= 1;
}
ha >>= 1;
while (hb <= b) {
hb <<= 1;
}
hb >>= 1;
if (ha != hb) return 0;
while (ha) {
if (ha & (a ^ b)) {
break;
} else if (ha & a) {
ans |= ha;
}
ha >>= 1;
}
return ans;
}
};