原题:
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
Note:
- The given integer is guaranteed to fit within the range of a 32-bit signed integer.
- You could assume no leading zero bit in the integer’s binary representation.
Example 1:
Input: 5 Output: 2 Explanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.
Example 2:
Input: 1 Output: 0 Explanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.
题意是给一个数,让你求出这个数对应二进制数按位取反的结果所对应的数。从个位数开始一位一位求就行,结果:
Success
Runtime: 0 ms, faster than 100.00% of C++ online submissions for Number Complement.
Memory Usage: 8.2 MB, less than 100.00% of C++ online submissions for Number Complement.
代码:
class Solution {
public:
int findComplement(int num) {
long index=1;
int r=0;
while(num>0){
if(num%2==0){r+=index;}
index+=index;
num/=2;
}
return r;
}
};