[leetcode] 1009. Complement of Base 10 Intege

Description

Every non-negative integer N has a binary representation. For example, 5 can be represented as “101” in binary, 11 as “1011” in binary, and so on. Note that except for N = 0, there are no leading zeroes in any binary representation.

The complement of a binary representation is the number in binary you get when changing every 1 to a 0 and 0 to a 1. For example, the complement of “101” in binary is “010” in binary.

For a given number N in base-10, return the complement of it’s binary representation as a base-10 integer.

Example 1:

Input: 5
Output: 2
Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.

Example 2:

Input: 7
Output: 0
Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.

Example 3:

Input: 10
Output: 5
Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.

Note:

1. 0 <= N < 10^9
2. This question is the same as

分析

题目的意思是：将一个数二进制取反，得到新的数。这道题思路也很直接，首先把十进制转换成二进制，然后取反，转换成10进制。

代码

class Solution:
    def bitwiseComplement(self, N: int) -> int:
        if(N==0):
            return 1
        res=0
        i=0
        while(N>0):
            b=N&1^1
            res+=b*2**i
            i+=1
            N=N>>1
        return res

参考文献

1009. Complement of Base 10 Integer