feat: reverse bits 풀이

Author: gusdn0828

missing-number/saysimple.py

@@ -0,0 +1,5 @@
+class Solution:
+    def missingNumber(self, nums: List[int]) -> int:
+        for i in range(len(nums)+1):
+            if i not in nums:
+                return i

number-of-1-bits/saysimple.py

@@ -0,0 +1,3 @@
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        return bin(n).count("1")

reverse-bits/saysimple.py

@@ -0,0 +1,3 @@
+class Solution:
+    def reverseBits(self, n: int) -> int:
+        return int(f"{bin(n)[2:]:0>32}"[::-1], 2)