leetcode_476:Number Complement(Bit Manipulation)(easy)

标签：etc   运算   不能   实现   sign   leading   div   ati   pre   

Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.

Note:

1. The given integer is guaranteed to fit within the range of a 32-bit signed integer.
2. 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.

solution:取反码，不能直接取反运算。
Python实现：

class Solution(object):
    def findComplement(self, num):
        """
        :type num: int
        :rtype: int
        """
        i = 1
        while i <= num:
            i = i << 1
        return (i - 1)^num

leetcode_476:Number Complement(Bit Manipulation)(easy)

标签：etc   运算   不能   实现   sign   leading   div   ati   pre   

原文地址：http://www.cnblogs.com/ytq1016/p/6943197.html