feat: reverse-bits

Author: junbinding

Diff for: bin.power-of-two.py

@@ -0,0 +1,12 @@
+class Solution:
+    """
+    231. 2的幂
+    https://leetcode-cn.com/problems/power-of-two/
+    给定一个整数，编写一个函数来判断它是否是 2 的幂次方。
+    """
+    def isPowerOfTwo(self, n: int) -> bool:
+        return n != 0 and n & (n - 1) == 0
+
+
+so = Solution()
+print(so.isPowerOfTwo(15))

Diff for: bin.reverse-bits.py

@@ -0,0 +1,17 @@
+class Solution:
+    """
+    190. 颠倒二进制位
+    https://leetcode-cn.com/problems/reverse-bits/
+    颠倒给定的 32 位无符号整数的二进制位。
+    """
+    def reverseBits(self, n: int) -> int:
+        res = 0
+        for i in range(32):
+            res = (res << 1) + (n & 1)
+            n = n >> 1
+
+        return res
+
+
+so = Solution()
+print(so.reverseBits(0o11111111111111111111111111111101))