feat: update solutions to leetcode problem: No.0136

Author: yanglbme

README.md

@@ -111,6 +111,7 @@
 
 ### 数学
 
+- [只出现一次的数字](/solution/0100-0199/0136.Single%20Number/README.md)
 - [数组中数字出现的次数](/lcof/面试题56%20-%20I.%20数组中数字出现的次数/README.md)
 - [数组中数字出现的次数 II](/lcof/面试题56%20-%20II.%20数组中数字出现的次数%20II/README.md)
 - [错误的集合](/solution/0600-0699/0645.Set%20Mismatch/README.md)

README_EN.md

@@ -105,6 +105,7 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 
 ### Math
 
+- [Single Number](/solution/0100-0199/0136.Single%20Number/README_EN.md)
 - [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md)
 - [Count Primes](/solution/0200-0299/0204.Count%20Primes/README_EN.md)
 - [Missing Number](/solution/0200-0299/0268.Missing%20Number/README_EN.md)

solution/0100-0199/0136.Single Number/README.md

@@ -61,6 +61,34 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var singleNumber = function (nums) {
+  let res = 0;
+  for (let num of nums) {
+    res ^= num;
+  }
+  return res;
+};
+```
+
+### **Go**
+
+```go
+func singleNumber(nums []int) int {
+	res := 0
+	for _, v := range nums {
+		res ^= v
+	}
+	return res
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0136.Single Number/README_EN.md

@@ -59,6 +59,34 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var singleNumber = function (nums) {
+  let res = 0;
+  for (let num of nums) {
+    res ^= num;
+  }
+  return res;
+};
+```
+
+### **Go**
+
+```go
+func singleNumber(nums []int) int {
+	res := 0
+	for _, v := range nums {
+		res ^= v
+	}
+	return res
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0136.Single Number/Solution.go

@@ -0,0 +1,7 @@
+func singleNumber(nums []int) int {
+	res := 0
+	for _, v := range nums {
+		res ^= v
+	}
+	return res
+}

solution/0100-0199/0136.Single Number/Solution.js

@@ -1,26 +1,11 @@
-const singleNumber2 = function (nums) {
-  const map = {};
-  for (let i = 0; i < nums.length; i++) {
-    if (map[nums[i]] === undefined) {
-      map[nums[i]] = 1;
-    } else if (map[nums[i]] === 1) {
-      map[nums[i]]++;
-    }
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var singleNumber = function (nums) {
+  let res = 0;
+  for (let num of nums) {
+    res ^= num;
   }
-  for (let key in map) {
-    if (map[key] === 1) {
-      return Number(key);
-    }
-  }
-};
-const singleNumber = function (nums) {
-  //XOR
-  let result = 0;
-  for (let i = 0; i < nums.length; i++) {
-    result = result ^ nums[i];
-  }
-  return result;
-
-  //or in es6
-  //return nums.reduce((result, num) => result ^ num, 0);
+  return res;
 };