LeetCode 476. Number Complement

最新推荐文章于 2024-11-29 07:15:00 发布

原创最新推荐文章于 2024-11-29 07:15:00 发布 · 942 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode

收录于

算法同时被 2 个专栏收录

141 篇文章

订阅专栏

LeetCode

129 篇文章

订阅专栏

本文介绍了一种针对正整数求其补数的算法实现。通过翻转输入整数的二进制表示中的每一位比特来获取其补数，并提供了一个具体的Python实现案例，包括两个示例：输入5时输出2，输入1时输出0。

Problem Statement

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.

Solution

class Solution(object):
    def findComplement(self, num):
        """
        :type num: int
        :rtype: int
        """
        s = bin(num)[2:]
        return int(''.join('0' if s[i] == '1' else '1' for i in xrange(len(s))), base=2)