feat: update leetcode solutions: No.0190. Reverse Bits

Author: yanglbme

Diff for: solution/0100-0199/0190.Reverse Bits/README.md

@@ -48,15 +48,31 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def reverseBits(self, n: int) -> int:
+        res = 0
+        for i in range(32):
+            res |= ((n & 1) << (31 - i))
+            n >>= 1
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+public class Solution {
+    // you need treat n as an unsigned value
+    public int reverseBits(int n) {
+        int res = 0;
+        for (int i = 0; i < 32 && n != 0; ++i) {
+            res |= ((n & 1) << (31 - i));
+            n >>>= 1;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

Diff for: solution/0100-0199/0190.Reverse Bits/README_EN.md

@@ -45,13 +45,29 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def reverseBits(self, n: int) -> int:
+        res = 0
+        for i in range(32):
+            res |= ((n & 1) << (31 - i))
+            n >>= 1
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+public class Solution {
+    // you need treat n as an unsigned value
+    public int reverseBits(int n) {
+        int res = 0;
+        for (int i = 0; i < 32 && n != 0; ++i) {
+            res |= ((n & 1) << (31 - i));
+            n >>>= 1;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

Diff for: solution/0100-0199/0190.Reverse Bits/Solution.java

@@ -2,10 +2,10 @@ public class Solution {
     // you need treat n as an unsigned value
     public int reverseBits(int n) {
         int res = 0;
-        for (int i = 0; i < 31; i++, n>>=1, res<<=1) {
-            res |= (n&1);
+        for (int i = 0; i < 32 && n != 0; ++i) {
+            res |= ((n & 1) << (31 - i));
+            n >>>= 1;
         }
-        res |= (n&1);
         return res;
     }
 }

Diff for: solution/0100-0199/0190.Reverse Bits/Solution.py

@@ -1,7 +1,7 @@
 class Solution:
-    # @param n, an integer
-    # @return an integer
-    def reverseBits(self, n):
-        B = bin(n)
-        B = (B[2:].rjust(32, "0"))[::-1]
-        return int(B, 2)
+    def reverseBits(self, n: int) -> int:
+        res = 0
+        for i in range(32):
+            res |= ((n & 1) << (31 - i))
+            n >>= 1
+        return res