LeetCode 1009: Complement of Base 10 Integer Solution

Master LeetCode problem 1009 (Complement of Base 10 Integer), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1009. Complement of Base 10 Integer

Easy

Bit Manipulation

Problem Explanation

Explanation

To find the complement of a base 10 integer, we can first convert the integer to its binary representation, then flip each bit to its complement. Finally, convert the complement back to a base 10 integer.

Convert the integer to binary representation.
Find the complement by flipping each bit.
Convert the complement back to base 10.

Time Complexity: O(log n) where n is the input integer. Space Complexity: O(1)

Solution Code

class Solution {
    public int bitwiseComplement(int n) {
        if (n == 0) return 1;
        
        int mask = 1;
        while (mask < n) {
            mask = (mask << 1) | 1;
        }
        
        return n ^ mask;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1009 (Complement of Base 10 Integer)?

This page provides optimized solutions for LeetCode problem 1009 (Complement of Base 10 Integer) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1009 (Complement of Base 10 Integer)?

The time complexity for LeetCode 1009 (Complement of Base 10 Integer) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1009 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1009 in Java, C++, or Python.

Back to LeetCode Solutions