476Number Complement

最新推荐文章于 2017-06-28 00:21:56 发布

accumulate_zhang

最新推荐文章于 2017-06-28 00:21:56 发布

阅读量445

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcoding in python leetcode with python&java

本文链接：https://blog.youkuaiyun.com/accumulate_zhang/article/details/55512048

leetcoding in python 同时被 2 个专栏收录

30 篇文章

订阅专栏

leetcode with python&java

28 篇文章

订阅专栏

本文介绍了一种求解正整数补码的有效算法。通过计算输入整数的二进制表示并翻转其位来得到补码。文章提供了两种实现方式，并通过实例展示了如何将整数转换为其补码形式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

one day one cannon

one week five connon

#coding=utf-8
'''
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.

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.

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.
'''
from math import log


class Solution(object):
    def findComplement(self,num):
        self.num=num
        print num
        len=int(log(num,2))+1
        y=(2**len)-1
        print y
        result=y^num
        print type(result)
        return result

    def findComplement1(self,num):
        self.num=num
        y=(1<<num.bit_length())-1       #这里在测试的时候，必须要以一个整型变量
        				#不能直接一个整数，如不能5.bit_length()

					#只能a=5;a.bit_length()
        return y^num

X=Solution()
print X.findComplement1(5)