feat: update leetcode/lcci solutions

* lcci No. 17.04. Missing Number
* leetcode No. 0136.Single Number

Author: yanglbme

lcci/17.04.Missing Number/README.md

@@ -39,9 +39,7 @@ class Solution:
     def missingNumber(self, nums: List[int]) -> int:
         res = 0
         for i, num in enumerate(nums):
-            res ^= i
-            res ^= num
-        res ^= len(nums)
+            res = res ^ num ^ (i + 1)
         return res
 ```
 
@@ -52,12 +50,10 @@ class Solution:
 ```java
 class Solution {
     public int missingNumber(int[] nums) {
-        int res = 0, n = nums.length;
-        for (int i = 0; i < n; ++i) {
-            res ^= i;
-            res ^= nums[i];
+        int res = 0;
+        for (int i = 0; i < nums.length; ++i) {
+            res = res ^ nums[i] ^ (i + 1);
         }
-        res ^= n;
         return res;
     }
 }
@@ -79,6 +75,21 @@ var missingNumber = function(nums) {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int missingNumber(vector<int>& nums) {
+        int res = 0;
+        for (int i = 0; i < nums.size(); ++i) {
+            res = res ^ nums[i] ^ (i + 1);
+        }
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```

lcci/17.04.Missing Number/README_EN.md

@@ -39,9 +39,7 @@ class Solution:
     def missingNumber(self, nums: List[int]) -> int:
         res = 0
         for i, num in enumerate(nums):
-            res ^= i
-            res ^= num
-        res ^= len(nums)
+            res = res ^ num ^ (i + 1)
         return res
 ```
 
@@ -50,12 +48,10 @@ class Solution:
 ```java
 class Solution {
     public int missingNumber(int[] nums) {
-        int res = 0, n = nums.length;
-        for (int i = 0; i < n; ++i) {
-            res ^= i;
-            res ^= nums[i];
+        int res = 0;
+        for (int i = 0; i < nums.length; ++i) {
+            res = res ^ nums[i] ^ (i + 1);
         }
-        res ^= n;
         return res;
     }
 }
@@ -77,6 +73,21 @@ var missingNumber = function(nums) {
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int missingNumber(vector<int>& nums) {
+        int res = 0;
+        for (int i = 0; i < nums.size(); ++i) {
+            res = res ^ nums[i] ^ (i + 1);
+        }
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```

lcci/17.04.Missing Number/Solution.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    int missingNumber(vector<int>& nums) {
+        int res = 0;
+        for (int i = 0; i < nums.size(); ++i) {
+            res = res ^ nums[i] ^ (i + 1);
+        }
+        return res;
+    }
+};

lcci/17.04.Missing Number/Solution.java

@@ -1,11 +1,9 @@
 class Solution {
     public int missingNumber(int[] nums) {
-        int res = 0, n = nums.length;
-        for (int i = 0; i < n; ++i) {
-            res ^= i;
-            res ^= nums[i];
+        int res = 0;
+        for (int i = 0; i < nums.length; ++i) {
+            res = res ^ nums[i] ^ (i + 1);
         }
-        res ^= n;
         return res;
     }
 }

lcci/17.04.Missing Number/Solution.py

@@ -2,7 +2,5 @@ class Solution:
     def missingNumber(self, nums: List[int]) -> int:
         res = 0
         for i, num in enumerate(nums):
-            res ^= i
-            res ^= num
-        res ^= len(nums)
+            res = res ^ num ^ (i + 1)
         return res

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

@@ -91,6 +91,21 @@ func singleNumber(nums []int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int singleNumber(vector<int>& nums) {
+        int res = 0;
+        for (auto num : nums) {
+            res ^= num;
+        }
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```

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

@@ -86,6 +86,21 @@ func singleNumber(nums []int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int singleNumber(vector<int>& nums) {
+        int res = 0;
+        for (auto num : nums) {
+            res ^= num;
+        }
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```

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

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

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

@@ -62,7 +62,7 @@ class Solution:
         res = 0
         for i in range(32):
             if bits[i] % 3 != 0:
-                res += (1 << i)
+                res |= (1 << i)
         # 如果为负数，先将 0-32 位取反（即 res ^ 0xffffffff ），再将所有位取反（即 ~ ）
         return res if bits[31] % 3 == 0 else ~(res ^ 0xffffffff)
 ```
@@ -85,7 +85,7 @@ class Solution {
         int res = 0;
         for (int i = 0; i < 32; ++i) {
             if (bits[i] % 3 == 1) {
-                res += (1 << i);
+                res |= (1 << i);
             }
         }
         return res;

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

@@ -44,7 +44,7 @@ class Solution:
         res = 0
         for i in range(32):
             if bits[i] % 3 != 0:
-                res += (1 << i)
+                res |= (1 << i)
         return res if bits[31] % 3 == 0 else ~(res ^ 0xffffffff)
 ```
 
@@ -64,7 +64,7 @@ class Solution {
         int res = 0;
         for (int i = 0; i < 32; ++i) {
             if (bits[i] % 3 == 1) {
-                res += (1 << i);
+                res |= (1 << i);
             }
         }
         return res;