p476

发表于 | 分类于 |

LeetCode p476 Number Complement 题解

1.题目：

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

题意：

给一个数，将他的二进制反转，0变1，1变0.
输出生成的数。

2.解题思路:

见代码

3.代码

[title] [] [url] [link text]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
 
public class Solution {
    public int findComplement(int num) {
        int ans = 0;
		int count = 1;
		while (num > 0) {
			int a = num % 2;
			if (a == 0) {
				ans += count;
			}
			count = 2 * count;
			num = num / 2;
		}
		return ans;
    }
}

4.一些总结：