观点：LeetCode 1009. Complement of Base 10 Integer

The complementof 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 5is "101"in binary and its complementis "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

就是先求出来这个数对应的二进制的数字，然后将二进制的1变成0,0变成1；再返回对应的十进制的数字，原理简单，但是我把0忽略了，所以fail一次；

下面是代码：

Runtime1 ms

Beats

20.95%

Memory39.8 MB

Beats

19.32%

Click the distribution chart to view more details

关键词：