• 476. Number Complement


    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 need to output 0.

    class Solution:
        def findComplement(self, num):
            """
            :type num: int
            :rtype: int
            """
            res = []
            for i in bin(num).split('b')[-1]:
                if i=='0':
                    res.append('1')
                else:
                    res.append('0')
            return int(''.join(res),2)
    
  • 相关阅读:
    吉文斯旋转
    MinHash
    MinHash 原理
    Mahout SlopOne
    svd++
    openwrt定制管理
    苹果新的编程语言 Swift 语言进阶(九)--方法和下标
    2014年百度之星程序设计大赛
    unixbench安装及使用
    数据库连接-ADO.NET
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9797509.html
Copyright © 2020-2023  润新知