-
Notifications
You must be signed in to change notification settings - Fork 5
/
day-34.cpp
33 lines (26 loc) · 746 Bytes
/
day-34.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/*
Number Complement
Solution
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its 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 outpu
*/
class Solution {
public:
int findComplement(int num) {
int result = 0;
int power = 1;
while (num > 0) {
result += (num % 2 ^ 1) * power;
power <<= 1;
num >>= 1;
}
return result;
}
};