leetcode 1009. Complement of Base 10 Integer

最新推荐文章于 2022-06-21 18:03:16 发布

_CL0v3r

最新推荐文章于 2022-06-21 18:03:16 发布

阅读量94

点赞数

文章标签：二进制补码位操作十进制转换二进制转换算法

本文链接：https://blog.csdn.net/Norikage/article/details/114526823

版权

Complement of Base 10 Integer

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:

0 <= N < 10^9

我的解：

class Solution:
    def bitwiseComplement(self, N: int) -> int:
        lst = []
        if N == 0: # 排除N为零的情况
            return 1
        while N != 0: # 转 2进制
            lst.append(N % 2)
            N //= 2
        for i in range(len(lst)): # 交换1和0
            if lst[i] == 1:
                lst[i] = 0
            elif lst[i] == 0:
                lst[i] = 1
        ans = 0
        mul = 1
        for i in reversed(lst[::-1]): # 转十进制
            ans += mul*i
            mul *= 2
        return ans

在这里插入图片描述
别人的解：

class Solution:
    def bitwiseComplement(self, N: int) -> int:
        N = bin(N)[2:]
        N = N.replace("0","3")
        N = N.replace("1","0")
        N = N.replace('3','1')
        return int(N,2)