feat: add solutions to leetcode No.0026.Remove Duplicates from Sorted…

… Array

solution/0000-0099/0026.Remove Duplicates from Sorted Array/README.md

@@ -13,9 +13,9 @@
 
 <p><strong>示例&nbsp;1:</strong></p>
 
-<pre>给定数组 <em>nums</em> = <strong>[1,1,2]</strong>, 
+<pre>给定数组 <em>nums</em> = <strong>[1,1,2]</strong>,
 
-函数应该返回新的长度 <strong>2</strong>, 并且原数组 <em>nums </em>的前两个元素被修改为 <strong><code>1</code></strong>, <strong><code>2</code></strong>。 
+函数应该返回新的长度 <strong>2</strong>, 并且原数组 <em>nums </em>的前两个元素被修改为 <strong><code>1</code></strong>, <strong><code>2</code></strong>。
 
 你不需要考虑数组中超出新长度后面的元素。</pre>
 
@@ -122,6 +122,28 @@ func removeDuplicates(nums []int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        int n = nums.size();
+        if(n < 2) {
+            return n;
+        }
+
+        int idx = 0;
+        for(int n : nums) {
+            if(idx < 1 || nums[idx-1] < n) {
+                nums[idx++] = n;
+            }
+        }
+        return idx;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/0000-0099/0026.Remove Duplicates from Sorted Array/README_EN.md

@@ -132,6 +132,28 @@ func removeDuplicates(nums []int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        int n = nums.size();
+        if(n < 2) {
+            return n;
+        }
+
+        int idx = 0;
+        for(int n : nums) {
+            if(idx < 1 || nums[idx-1] < n) {
+                nums[idx++] = n;
+            }
+        }
+        return idx;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/0000-0099/0026.Remove Duplicates from Sorted Array/Solution.cpp

@@ -0,0 +1,20 @@
+/**
+ *  Author: Moriarty12138
+ */
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        int n = nums.size();
+        if(n < 2) {
+            return n;
+        }
+
+        int idx = 0;
+        for(int n : nums) {
+            if(idx < 1 || nums[idx-1] < n) {
+                nums[idx++] = n;
+            }
+        }
+        return idx;
+    }
+};