feat: add solutions to lc problem: No.0136

No.0136.Single Number

Author: yanglbme

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

@@ -105,7 +105,9 @@ class Solution {
 public:
     int singleNumber(vector<int>& nums) {
         int ans = 0;
-        for (int v : nums) ans ^= v;
+        for (int v : nums) {
+            ans ^= v;
+        }
         return ans;
     }
 };
@@ -130,11 +132,7 @@ func singleNumber(nums []int) (ans int) {
  * @return {number}
  */
 var singleNumber = function (nums) {
-    let ans = 0;
-    for (const v of nums) {
-        ans ^= v;
-    }
-    return ans;
+    return nums.reduce((a, b) => a ^ b);
 };
 ```
 
@@ -173,14 +171,17 @@ int singleNumber(int* nums, int numsSize) {
 ```swift
 class Solution {
     func singleNumber(_ nums: [Int]) -> Int {
-        var a = nums.sorted()
-        var n = a.count
-        for i in stride(from: 0, through: n - 2, by: 2) {
-            if a[i] != a[i + 1] {
-                return a[i]
-            }
-        }
-        return a[n - 1]
+        return nums.reduce(0, ^)
+    }
+}
+```
+
+### **C#**
+
+```cs
+public class Solution {
+    public int SingleNumber(int[] nums) {
+        return nums.Aggregate(0, (a, b) => a ^ b);
     }
 }
 ```

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

@@ -69,7 +69,9 @@ class Solution {
 public:
     int singleNumber(vector<int>& nums) {
         int ans = 0;
-        for (int v : nums) ans ^= v;
+        for (int v : nums) {
+            ans ^= v;
+        }
         return ans;
     }
 };
@@ -94,11 +96,7 @@ func singleNumber(nums []int) (ans int) {
  * @return {number}
  */
 var singleNumber = function (nums) {
-    let ans = 0;
-    for (const v of nums) {
-        ans ^= v;
-    }
-    return ans;
+    return nums.reduce((a, b) => a ^ b);
 };
 ```
 
@@ -137,14 +135,17 @@ int singleNumber(int* nums, int numsSize) {
 ```swift
 class Solution {
     func singleNumber(_ nums: [Int]) -> Int {
-        var a = nums.sorted()
-        var n = a.count
-        for i in stride(from: 0, through: n - 2, by: 2) {
-            if a[i] != a[i + 1] {
-                return a[i]
-            }
-        }
-        return a[n - 1]
+        return nums.reduce(0, ^)
+    }
+}
+```
+
+### **C#**
+
+```cs
+public class Solution {
+    public int SingleNumber(int[] nums) {
+        return nums.Aggregate(0, (a, b) => a ^ b);
     }
 }
 ```

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

@@ -1,8 +1,10 @@
-class Solution {
-public:
-    int singleNumber(vector<int>& nums) {
-        int ans = 0;
-        for (int v : nums) ans ^= v;
-        return ans;
-    }
+class Solution {
+public:
+    int singleNumber(vector<int>& nums) {
+        int ans = 0;
+        for (int v : nums) {
+            ans ^= v;
+        }
+        return ans;
+    }
 };

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

@@ -0,0 +1,5 @@
+public class Solution {
+    public int SingleNumber(int[] nums) {
+        return nums.Aggregate(0, (a, b) => a ^ b);
+    }
+}

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

@@ -3,9 +3,5 @@
  * @return {number}
  */
 var singleNumber = function (nums) {
-    let ans = 0;
-    for (const v of nums) {
-        ans ^= v;
-    }
-    return ans;
+    return nums.reduce((a, b) => a ^ b);
 };

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

@@ -1,12 +1,5 @@
-class Solution {
-    func singleNumber(_ nums: [Int]) -> Int {
-        var a = nums.sorted()
-        var n = a.count
-        for i in stride(from: 0, through: n - 2, by: 2) {
-            if a[i] != a[i + 1] {
-                return a[i]
-            }
-        }
-        return a[n - 1]
-    }
+class Solution {
+    func singleNumber(_ nums: [Int]) -> Int {
+        return nums.reduce(0, ^)
+    }
 }