public int findComplement1(int num) {
int maxBitNum = 0;
int tmpNum = num;
while (tmpNum > 0) {
maxBitNum += 1;
tmpNum >>= 1;
}
return num ^ ((1 << maxBitNum) - 1);
}
异或位运算
最新推荐文章于 2022-07-07 20:02:36 发布