LeetCode-476. Number Complement [C++][Java]

LeetCode-476. Number ComplementLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/number-complement/

The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation.

• For example, The integer 5 is "101" in binary and its complement is "010" which is the integer 2.

Given an integer num, return its complement.

Example 1:

Input: num = 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: num = 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.

Constraints:

• 1 <= num < 2^31

Note: This question is the same as 1009: Loading...https://leetcode.com/problems/complement-of-base-10-integer/

 

【C++】

1. 移位大法

class Solution {
public:
    int findComplement(int num) {
        int mask = num;
        mask |= mask >> 1;
        mask |= mask >> 2;
        mask |= mask >> 4;
        mask |= mask >> 8;
        mask |= mask >> 16;
        return (mask ^ num);
    }
};

2. 相除取余

class Solution {
public:
    int findComplement(int num) {
        vector<int> P;
        while (num > 0) {
            if (num % 2 == 0) P.push_back(1);
            else P.push_back(0);
            num = num/2;
        }
        int sum = 0;
        for(int i=0; i<P.size(); i++){
            sum += P[i] * pow(2,i);
        }
        return sum;
    }
};

再少一点空间

class Solution {
public:
    int findComplement(int num) {
        int sum = 0, i = 0;
        while (num > 0) {
            if (num % 2 == 0) {
                sum += 1 * pow(2,i++);
            } else {i++;};
            num = num/2;
        }
        return sum;
    }
};

【Java】

class Solution {
    public int findComplement(int num) {
        int sum = 0, i = 0;
        while (num > 0) {
            if (num % 2 == 0) {
                sum += 1 * Math.pow(2,i++);
            } else {i++;};
            num = num/2;
        }
        return sum;
    }
}