feat: update leetcode solutions: No.0007, No.0099

Author: yanglbme

solution/0000-0099/0007.Reverse Integer/README.md

@@ -39,16 +39,32 @@
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
-```python
+转字符串，进行翻转。
 
+```python
+class Solution:
+    def reverse(self, x: int) -> int:
+        y = int(str(abs(x))[::-1])
+        res = -y if x < 0 else y
+        return 0 if res < -2**31 or res > 2**31 -1 else res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int reverse(int x) {
+        long res = 0;
+        // 考虑负数情况，所以这里条件为: x != 0
+        while (x != 0) {
+            res = res * 10 + (x % 10);
+            x /= 10;
+        }
+        return res < Integer.MIN_VALUE || res > Integer.MAX_VALUE ? 0 : (int) res;
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0007.Reverse Integer/README_EN.md

@@ -47,13 +47,26 @@ Assume we are dealing with an environment which could only store integers within
 ### **Python3**
 
 ```python
-
+class Solution:
+    def reverse(self, x: int) -> int:
+        y = int(str(abs(x))[::-1])
+        res = -y if x < 0 else y
+        return 0 if res < -2**31 or res > 2**31 -1 else res
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int reverse(int x) {
+        long res = 0;
+        while (x != 0) {
+            res = res * 10 + (x % 10);
+            x /= 10;
+        }
+        return res < Integer.MIN_VALUE || res > Integer.MAX_VALUE ? 0 : (int) res;
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0007.Reverse Integer/Solution.java

@@ -1,25 +1,3 @@
-/*
-class Solution {
-    public int reverse(int x) {
-        if (x == 0) {
-            return x;
-        }
-        
-        long tmp = x;
-        boolean isPositive = true;
-        if (tmp < 0) {
-            isPositive = false;
-            tmp = -tmp;
-        }
-        
-        long val = Long.parseLong(new StringBuilder(String.valueOf(tmp)).reverse().toString());
-        
-        return isPositive ? (val > Integer.MAX_VALUE ? 0 : (int) val) : (-val < Integer.MIN_VALUE ? 0 : (int) (-val)); 
-        
-    }
-}
-*/
-
 class Solution {
     public int reverse(int x) {
         long res = 0;
@@ -28,9 +6,6 @@ public int reverse(int x) {
             res = res * 10 + (x % 10);
             x /= 10;
         }
-        return (res < Integer.MIN_VALUE || res > Integer.MAX_VALUE) 
-            ? 0
-            : (int) res;
-            
+        return res < Integer.MIN_VALUE || res > Integer.MAX_VALUE ? 0 : (int) res;
     }
 }

solution/0000-0099/0007.Reverse Integer/Solution.py

@@ -1,20 +1,5 @@
 class Solution:
-    def reverse(self, x):
-        """
-        :type x: int
-        :rtype: int
-        """
-        if x==0:
-            return 0
-        y=str(abs(x))
-        y=y[::-1]
-        y=int(y)
-        if x<0:
-            tmp=-y
-        else:
-            tmp=y
-        
-        if tmp>=2**31-1 or tmp<-(2**31):
-            return 0
-        else:
-            return tmp
+    def reverse(self, x: int) -> int:
+        y = int(str(abs(x))[::-1])
+        res = -y if x < 0 else y
+        return 0 if res < -2**31 or res > 2**31 -1 else res

solution/0100-0199/0190.Reverse Bits/README.md

@@ -75,6 +75,40 @@ public class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    uint32_t reverseBits(uint32_t n) {
+        uint32_t res = 0;
+        for (int i = 0; i < 32; ++i) {
+            res |= ((n & 1) << (31 - i));
+            n >>= 1;
+        }
+        return res;
+    }
+};
+```
+
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n - a positive integer
+ * @return {number} - a positive integer
+ */
+var reverseBits = function (n) {
+  let res = 0;
+  for (let i = 0; i < 32 && n > 0; ++i) {
+    res |= (n & 1) << (31 - i);
+    n >>>= 1;
+  }
+  // 无符号右移
+  return res >>> 0;
+};
+```
+
 ### **...**
 
 ```

solution/0100-0199/0190.Reverse Bits/README_EN.md

@@ -70,6 +70,39 @@ public class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    uint32_t reverseBits(uint32_t n) {
+        uint32_t res = 0;
+        for (int i = 0; i < 32; ++i) {
+            res |= ((n & 1) << (31 - i));
+            n >>= 1;
+        }
+        return res;
+    }
+};
+```
+
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n - a positive integer
+ * @return {number} - a positive integer
+ */
+var reverseBits = function (n) {
+  let res = 0;
+  for (let i = 0; i < 32 && n > 0; ++i) {
+    res |= (n & 1) << (31 - i);
+    n >>>= 1;
+  }
+  return res >>> 0;
+};
+```
+
 ### **...**
 
 ```

solution/0100-0199/0190.Reverse Bits/Solution.cpp

@@ -1,16 +1,11 @@
 class Solution {
 public:
     uint32_t reverseBits(uint32_t n) {
-        uint32_t res = 0 ;
-        uint32_t tmp = 1 << 31 ;
-        while (n)
-        {
-            if (n&1)
-                res |= tmp ;
-            tmp >>= 1 ;
-            n >>= 1 ;
+        uint32_t res = 0;
+        for (int i = 0; i < 32; ++i) {
+            res |= ((n & 1) << (31 - i));
+            n >>= 1;
         }
-        
-        return res ;
+        return res;
     }
 };

solution/0100-0199/0190.Reverse Bits/Solution.js

@@ -1,6 +1,12 @@
-const reverseBits = function (n) {
-  return parseInt(
-    n.toString(2).split("").reverse().join("").padEnd(32, "0"),
-    2
-  );
+/**
+ * @param {number} n - a positive integer
+ * @return {number} - a positive integer
+ */
+var reverseBits = function (n) {
+  let res = 0;
+  for (let i = 0; i < 32 && n > 0; ++i) {
+    res |= (n & 1) << (31 - i);
+    n >>>= 1;
+  }
+  return res >>> 0;
 };