1009. Complement of Base 10 Integer*

1009. Complement of Base 10 Integer*

https://leetcode.com/problems/complement-of-base-10-integer/

题目描述

Every non-negative integer N has a binary representation. For example, 5 can be represented as "101" in binary, 11 as "1011" in binary, and so on. Note that except for N = 0, there are no leading zeroes in any binary representation.

The complement of a binary representation is the number in binary you get when changing every 1 to a 0 and 0 to a 1. For example, the complement of "101" in binary is "010" in binary.

For a given number N in base-10, return the complement of it’s binary representation as a base-10 integer.

Example 1:

Input: 5
Output: 2
Explanation: 5 is "101" in binary, with complement "010" in binary, which is 2 in base-10.

Example 2:

Input: 7
Output: 0
Explanation: 7 is "111" in binary, with complement "000" in binary, which is 0 in base-10.

Example 3:

Input: 10
Output: 5
Explanation: 10 is "1010" in binary, with complement "0101" in binary, which is 5 in base-10.

Note:

• 0 <= N < 10^9

C++ 实现 1

从 868. Binary Gap* 学习用右移以及按位与 & 来获取二进制的每一位 binary. 为了获取合适长度的位而不是一直执行循环 32 次, 用 sum 来进行控制. 注意 N == 0 时需要专门处理.

class Solution {
public:
    int bitwiseComplement(int N) {
        if (N == 0) return 1;
        int res = 0, sum = 0;
        for (int i = 0; i < 32; ++ i) {
            int binary = (N >> i) & 1;
            sum += (binary << i);
            if (sum >= N) break;
            int complement = 1 - binary;
            res += (complement << i);
        }
        return res;
    }
};

C++ 实现 2

来自 LeetCode Submission.

class Solution {
public:
    int bitwiseComplement(int N) {
        if (!N)
            return 1;
        
        int exponent = 0;
        int res = 0;
        
        while (N) {
        	// 这里只考虑二进制为 0, 翻转后为 1 的情况
            if (!(N & 1))
                res += (1 << exponent);
            
            exponent++;
            N >>= 1;
        }        
        return res;
    }
};