D. J.:

- Added the leetcode problem and solution for 476

Author: nobodyPerfecZ

README.md

@@ -246,6 +246,7 @@
 - [452 Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/)
 - [461 Hamming Distance](https://leetcode.com/problems/hamming-distance/description/)
 - [474 Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/description/)
+- [476 Number Complement](https://leetcode.com/problems/number-complement/description/)
 - [477 Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/description/)
 - [502 IPO](https://leetcode.com/problems/ipo/description/)
 - [509 Fibonacci Number](https://leetcode.com/problems/fibonacci-number/description/)
@@ -271,6 +272,7 @@
 - [931 Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/description/)
 - [933 Number of Recent Cells](https://leetcode.com/problems/number-of-recent-calls/description/)
 - [983 Minimum Cost for Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/description/)
+- [1009 Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/description/)
 - [1027 Longest Arithmetic Subsequence](https://leetcode.com/problems/longest-arithmetic-subsequence/description/)
 - [1035 Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/description/)
 - [1137 N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/description/)

awesome_python_leetcode/_1009_complement_of_base_10_integer.py

@@ -0,0 +1,24 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def bitwiseComplement(self, n: int) -> int:
+        """
+        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.
+        """
+        if n == 0:
+            return 1
+
+        res = 0
+        i = 0
+        while n != 0:
+            bit = n & 1
+            res += (bit ^ 1) << i
+            n >>= 1
+            i += 1
+        return res

awesome_python_leetcode/_476_number_complement.py

@@ -0,0 +1,23 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def findComplement(self, num: int) -> int:
+        """
+        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.
+        """
+        if num == 0:
+            return 1
+
+        res = 0
+        i = 0
+        while num != 0:
+            bit = num & 1
+            res += (bit ^ 1) << i
+            num >>= 1
+            i += 1
+        return res

tests/test_1009_complement_of_base_10_integer.py

@@ -0,0 +1,18 @@
+import pytest
+
+from awesome_python_leetcode._1009_complement_of_base_10_integer import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["num", "expected"],
+    argvalues=[
+        (5, 2),
+        (7, 0),
+        (10, 5),
+        (0, 1),
+    ],
+)
+def test_func(num: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    complement = Solution().bitwiseComplement(num)
+    assert complement == expected

tests/test_476_number_complements.py

@@ -0,0 +1,17 @@
+import pytest
+
+from awesome_python_leetcode._476_number_complement import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["num", "expected"],
+    argvalues=[
+        (5, 2),
+        (1, 0),
+        (0, 1),
+    ],
+)
+def test_func(num: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    complement = Solution().findComplement(num)
+    assert complement == expected