leetcode - 476 - 数字的补数

class Solution:
    def findComplement(self, num):
        """
        :type num: int
        :rtype: int
        """
        m = bin(num)
        m = m[2:]
        n=[str(1-int(i)) for i in m]
        k = "".join(n)
        k = int(k,2)
        
        return k

猜你喜欢

转载自blog.csdn.net/hustwayne/article/details/83545060