feat: add solutions to lc problems: No.0136, 0137

- No.0136.Single Number
- No.0137.Single Number II

Author: YangFong

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

@@ -138,20 +138,36 @@ var singleNumber = function (nums) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function singleNumber(nums: number[]): number {
+    return nums.reduce((r, v) => r ^ v);
+}
+```
+
 ### **Rust**
 
 ```rust
 impl Solution {
     pub fn single_number(nums: Vec<i32>) -> i32 {
-        let mut result = 0;
-        for num in nums {
-            result ^= num;
-        }
-        result
+        nums.into_iter().reduce(|r, v| r ^ v).unwrap()
     }
 }
 ```
 
+### **C**
+
+```c
+int singleNumber(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans ^= nums[i];
+    }
+    return ans;
+}
+```
+
 ### **Swift**
 
 ```swift

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

@@ -102,20 +102,36 @@ var singleNumber = function (nums) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function singleNumber(nums: number[]): number {
+    return nums.reduce((r, v) => r ^ v);
+}
+```
+
 ### **Rust**
 
 ```rust
 impl Solution {
     pub fn single_number(nums: Vec<i32>) -> i32 {
-        let mut result = 0;
-        for num in nums {
-            result ^= num;
-        }
-        result
+        nums.into_iter().reduce(|r, v| r ^ v).unwrap()
     }
 }
 ```
 
+### **C**
+
+```c
+int singleNumber(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans ^= nums[i];
+    }
+    return ans;
+}
+```
+
 ### **Swift**
 
 ```swift

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

@@ -0,0 +1,7 @@
+int singleNumber(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans ^= nums[i];
+    }
+    return ans;
+}

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

@@ -1,9 +1,5 @@
 impl Solution {
     pub fn single_number(nums: Vec<i32>) -> i32 {
-        let mut result = 0;
-        for num in nums {
-            result ^= num;
-        }
-        result
+        nums.into_iter().reduce(|r, v| r ^ v).unwrap()
     }
-}
+}

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

@@ -0,0 +1,3 @@
+function singleNumber(nums: number[]): number {
+    return nums.reduce((r, v) => r ^ v);
+}

solution/0100-0199/0137.Single Number II/README.md

@@ -122,6 +122,52 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function singleNumber(nums: number[]): number {
+    let ans = 0;
+    for (let i = 0; i < 32; i++) {
+        const count = nums.reduce((r, v) => r + ((v >> i) & 1), 0);
+        ans |= count % 3 << i;
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn single_number(nums: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        for i in 0..32 {
+            let count = nums.iter().map(|v| v >> i & 1).sum::<i32>();
+            ans |= count % 3 << i;
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int singleNumber(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < 32; i++) {
+        int count = 0;
+        for (int j = 0; j < numsSize; j++) {
+            if (nums[j] >> i & 1) {
+                count++;
+            }
+        }
+        ans |= (uint)(count % 3) << i;
+    }
+    return ans;
+}
+```
+
 ### **Swift**
 
 ```swift

solution/0100-0199/0137.Single Number II/README_EN.md

@@ -101,6 +101,52 @@ public:
 };
 ```
 
+### **TypeScript**
+
+```ts
+function singleNumber(nums: number[]): number {
+    let ans = 0;
+    for (let i = 0; i < 32; i++) {
+        const count = nums.reduce((r, v) => r + ((v >> i) & 1), 0);
+        ans |= count % 3 << i;
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn single_number(nums: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        for i in 0..32 {
+            let count = nums.iter().map(|v| v >> i & 1).sum::<i32>();
+            ans |= count % 3 << i;
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int singleNumber(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < 32; i++) {
+        int count = 0;
+        for (int j = 0; j < numsSize; j++) {
+            if (nums[j] >> i & 1) {
+                count++;
+            }
+        }
+        ans |= (uint)(count % 3) << i;
+    }
+    return ans;
+}
+```
+
 ### **Swift**
 
 ```swift

solution/0100-0199/0137.Single Number II/Solution.c

@@ -0,0 +1,13 @@
+int singleNumber(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < 32; i++) {
+        int count = 0;
+        for (int j = 0; j < numsSize; j++) {
+            if (nums[j] >> i & 1) {
+                count++;
+            }
+        }
+        ans |= (uint)(count % 3) << i;
+    }
+    return ans;
+}

solution/0100-0199/0137.Single Number II/Solution.rs

@@ -0,0 +1,10 @@
+impl Solution {
+    pub fn single_number(nums: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        for i in 0..32 {
+            let count = nums.iter().map(|v| v >> i & 1).sum::<i32>();
+            ans |= count % 3 << i;
+        }
+        ans
+    }
+}

solution/0100-0199/0137.Single Number II/Solution.ts

@@ -0,0 +1,8 @@
+function singleNumber(nums: number[]): number {
+    let ans = 0;
+    for (let i = 0; i < 32; i++) {
+        const count = nums.reduce((r, v) => r + ((v >> i) & 1), 0);
+        ans |= count % 3 << i;
+    }
+    return ans;
+}