feat: _007题的js题解

Author: taryn2016

README.md

@@ -25,7 +25,7 @@
 | 题目                 | 题解                                                         | Java           | JavaScript   | kotlin          |
 | :-----------------: | ------------------------------------------------------------ | :------------: |:-----------: | :-------------: |
 | [001][001-question] | [Two Sum][001-tips]                                          | [✅][001-java] | [✅][001-js] | [✅][001-kotlin] |
-| [007][007-question] | [Reverse Integer][007-tips]                                  | [✅][007-java] |              | [✅][007-kotlin] |
+| [007][007-question] | [Reverse Integer][007-tips]                                  | [✅][007-java] | [✅][007-js] | [✅][007-kotlin] |
 | [009][009-question] | [Palindrome Number][009-tips]                                | [✅][009-java] |              | [✅][009-kotlin] |
 | [013][013-question] | [Roman to Integer][013-tips]                                 | [✅][013-java] |              | [✅][013-kotlin] |
 | [014][014-question] | [Longest Common Prefix][014-tips]                            | [✅][014-java] |              |                  |
@@ -118,7 +118,7 @@
 | [050][050-question] | [Pow(x, n)][050-tips]                                        | [✅][050-java] |              |                  |
 | [056][056-question] | [Merge Intervals][056-tips]                                  | [✅][056-java] |              |                  |
 | [554][554-question] | [Brick Wall][554-tips]                                       | [✅][554-java] |              |                  |
- 
+
 ## [Hard](https://leetcode.com/problemset/all/?difficulty=Hard)
 | 题目                | 题解                                                          | Java           | JavaScript   | kotlin           |
 | :-----------------: | ------------------------------------------------------------ | :------------: | :----------: | :--------------: |
@@ -343,6 +343,7 @@
 [806-tips]: ./tips/806/README.md
 
 [001-js]: ./src/_001/Solution.js
+[007-js]: ./src/_007/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js
@@ -451,4 +452,4 @@
 [007-kotlin]: ./src/_007/kotlin/Solution.kt
 [009-kotlin]: ./src/_009/kotlin/Solution.kt
 [013-kotlin]: ./src/_013/kotlin/Solution.kt
-[771-kotlin]: ./src/_771/kotlin/Solution.kt
+[771-kotlin]: ./src/_771/kotlin/Solution.kt

src/_007/Solution.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number} x
+ * @return {number}
+ */
+var reverse = function(x) {
+    var reverse = 0
+    var arr = String(x).split('')
+    if (x >= 0) {
+	    reverse = Number(arr.reverse().join(''))
+    } else {
+	    reverse = -Number(arr.slice(1,arr.length).reverse().join(''))
+    }
+    if ((reverse >= Math.pow(2,31) - 1) || (reverse <= -Math.pow(2,31))) {
+        reverse = 0
+    }
+    return reverse
+};

tips/007/README.md

@@ -63,6 +63,22 @@ class Solution {
 }
 ```
 
+```JavaScript
+var reverse = function(x) {
+    var reverse = 0
+    var arr = String(x).split('')
+    if (x >= 0) {
+	    reverse = Number(arr.reverse().join(''))
+    } else {
+	    reverse = -Number(arr.slice(1,arr.length).reverse().join(''))
+    }
+    if ((reverse >= Math.pow(2,31) - 1) || (reverse <= -Math.pow(2,31))) {
+        reverse = 0
+    }
+    return reverse
+};
+```
+
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]