class Solution {
public:
int rangeBitwiseAnd(int left, int right) {
int res;
for(int i = 0; i < 32; ++i){
if(left >> i == right >> i){ //找数字相同的最小位
res = (left >> i) << i; //右边全置零
break;
}
}
return res;
}
};
LeetCode 201. 数字范围按位与
最新推荐文章于 2024-09-04 15:29:39 发布