-
Notifications
You must be signed in to change notification settings - Fork 0
/
complement of number.txt
56 lines (36 loc) · 1.08 KB
/
complement of number.txt
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation.
For example, The integer 5 is "101" in binary and its complement is "010" which is the integer 2.
Given an integer n, return its complement.
Example 1:
Input: n = 5
Output: 2
Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.
Example 2:
Input: n = 7
Output: 0
Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.
Example 3:
Input: n = 10
Output: 5
Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.
Constraints:
0 <= n < 109
Solution
class Solution {
public:
int bitwiseComplement(int n) {
int m = n;
int left_shift = 0;
if(n == 0)
{
return 1;
}
while(m != 0)
{
left_shift = (left_shift << 1) | 1;
m = m >> 1;
}
int ans = (~n) & left_shift;
return ans;
}
};