feat: add solution of Single Number(136) with javascript.

Author: taryn2016

README.md

@@ -86,7 +86,7 @@
 | [121][121-question] | [Best Time to Buy and Sell Stock][121-tips]                  | [Easy][E]   | [✅][121-java] | [✅][121-js] | [✅][121-kotlin] |
 | [122][122-question] | [Best Time to Buy and Sell Stock II][122-tips]               | [Easy][E]   | [✅][122-java] | [✅][122-js] | [✅][122-kotlin] |
 | [125][125-question] | [Valid Palindrome][125-tips]                                 | [Easy][E]   |                | [✅][125-js] | [✅][125-kotlin] |
-| [136][136-question] | [Single Number][136-tips]                                    | [Easy][E]   |                |              | [✅][136-kotlin] |
+| [136][136-question] | [Single Number][136-tips]                                    | [Easy][E]   |                | [✅][136-js]  | [✅][136-kotlin] |
 | [141][141-question] | [Linked List Cycle][141-tips]                                | [Easy][E]   | [✅][141-java] |              |        -         |
 | [155][155-question] | [Min Stack][155-tips]                                        | [Easy][E]   | [✅][155-java] |              | [✅][155-kotlin] |
 | [160][160-question] | [Intersection of Two Linked Lists][160-tips]                 | [Easy][E]   | [✅][160-java] |              |        -         |
@@ -466,6 +466,7 @@ commit信息模板: ``feat: add the solution of `Two Sum`(001) with Java``
 [121-js]: ./src/_121/Solution.js
 [122-js]: ./src/_122/Solution.js
 [125-js]: ./src/_125/Solution.js
+[136-js]: ./src/_136/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js

src/_136/Solution.js

@@ -0,0 +1,11 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var singleNumber = function(nums) {
+  var x = 0
+  for(let i = 0; i < nums.length; i++) {
+      x = x^nums[i]
+  }
+  return x
+};

tips/136/README.md

@@ -63,6 +63,19 @@ fun singleNumber(nums: IntArray): Int {
 }
 ```
 
+```JavaScript
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var singleNumber = function(nums) {
+    var x = 0
+    for(let i = 0; i < nums.length; i++) {
+        x = x^nums[i]
+    }
+    return x
+};
+```
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]