首页 > 其他 > 详细

476. Number Complement

时间:2018-10-31 12:11:05      阅读:149      评论:0      收藏:0      [点我收藏+]

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)

476. Number Complement

原文:https://www.cnblogs.com/bernieloveslife/p/9797509.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!