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.
my answer:
...
class Solution {
public:
int findComplement(int num) {
int a[100];
int b[100];
int e[100];
int i=0;
int c=1;
int f=0;
while(num!=0)
{
a[i]=num%2;
i++;
num/=2;
}
for(int j=0;j<i;j++)
{
if(a[j]==0)
b[j]=1;
else
b[j]=0;
}
for(int k=0;k<i;k++)
{
e[k]=b[k]*c;
c*=2;
f+=e[k];
}
return f;
}
};
...
需要注意事项:
数量补语:
例1:
输入:5
输出:2
说明:5的二进制表示为101(不带前导零位),其补码为010。所以你需要输出2。
例2:
输入:1
输出:0
说明:1的二进制表示为1(不带前导零位),其补码为0。所以你需要输出0。
做题时需要注意:
1.2个数组的转换;
2.2进制数的求写;
3.把2进制数转换成10进制数。