1009. Complement of Base 10 Integer LeetCode Solution

In this guide, you will get 1009. Complement of Base 10 Integer LeetCode Solution with the best time and space complexity. The solution to Complement of Base Integer problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Complement of Base Integer solution in C++
4. Complement of Base Integer solution in Java
5. Complement of Base Integer solution in Python
6. Additional Resources

Problem Statement of Complement of Base Integer

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 n, return its complement.

Example 1:

Input: n = 5
Output: 2
Explanation: 5 is “101” in binary, with complement “010” in binary, which is 2 in base-10.

Example 2:

Input: n = 7
Output: 0
Explanation: 7 is “111” in binary, with complement “000” in binary, which is 0 in base-10.

Example 3:

Input: n = 10
Output: 5
Explanation: 10 is “1010” in binary, with complement “0101” in binary, which is 5 in base-10.

Constraints:

0 <= n < 109

Note: This question is the same as 476: https://leetcode.com/problems/number-complement/

Complexity Analysis

• Time Complexity: O(\log n)
• Space Complexity: O(1)

1009. Complement of Base 10 Integer LeetCode Solution in C++

class Solution {
 public:
  int bitwiseComplement(int n) {
    int mask = 1;
    while (mask < n)
      mask = (mask << 1) + 1;
    return mask ^ n;
  }
};
/* code provided by PROGIEZ */

1009. Complement of Base 10 Integer LeetCode Solution in Java

class Solution {
  public int bitwiseComplement(int n) {
    int mask = 1;
    while (mask < n)
      mask = (mask << 1) + 1;
    return mask ^ n;
  }
}
// code provided by PROGIEZ

1009. Complement of Base 10 Integer LeetCode Solution in Python

class Solution:
  def bitwiseComplement(self, n: int) -> int:
    mask = 1
    while mask < n:
      mask = (mask << 1) + 1
    return mask ^ n
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.