feat: update leetcode solutions: No.0026. Remove Duplicates from Sorted Array

Author: yanglbme

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

@@ -128,20 +128,37 @@ func removeDuplicates(nums []int) int {
 class Solution {
 public:
     int removeDuplicates(vector<int>& nums) {
-        int n = nums.size();
-        if(n < 2) {
-            return n;
+        int cnt = 0, n = nums.size();
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] == nums[i - 1]) ++cnt;
+            else nums[i - cnt] = nums[i];
         }
+        return n - cnt;
+    }
+};
+```
 
-        int idx = 0;
-        for(int n : nums) {
-            if(idx < 1 || nums[idx-1] < n) {
-                nums[idx++] = n;
+### **C#**
+
+```cs
+public class Solution {
+    public int RemoveDuplicates(int[] nums) {
+        int cnt = 0;
+        int n = nums.Length;
+        for (int i = 1; i < n; ++i)
+        {
+            if (nums[i] == nums[i - 1])
+            {
+                ++cnt;
+            }
+            else
+            {
+                nums[i - cnt] = nums[i];
             }
         }
-        return idx;
+        return n - cnt;
     }
-};
+}
 ```
 
 ### **...**

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

@@ -138,20 +138,37 @@ func removeDuplicates(nums []int) int {
 class Solution {
 public:
     int removeDuplicates(vector<int>& nums) {
-        int n = nums.size();
-        if(n < 2) {
-            return n;
+        int cnt = 0, n = nums.size();
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] == nums[i - 1]) ++cnt;
+            else nums[i - cnt] = nums[i];
         }
+        return n - cnt;
+    }
+};
+```
 
-        int idx = 0;
-        for(int n : nums) {
-            if(idx < 1 || nums[idx-1] < n) {
-                nums[idx++] = n;
+### **C#**
+
+```cs
+public class Solution {
+    public int RemoveDuplicates(int[] nums) {
+        int cnt = 0;
+        int n = nums.Length;
+        for (int i = 1; i < n; ++i)
+        {
+            if (nums[i] == nums[i - 1])
+            {
+                ++cnt;
+            }
+            else
+            {
+                nums[i - cnt] = nums[i];
             }
         }
-        return idx;
+        return n - cnt;
     }
-};
+}
 ```
 
 ### **...**

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

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

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

@@ -1,16 +1,18 @@
 public class Solution {
     public int RemoveDuplicates(int[] nums) {
-        if (nums.Length < 2) return nums.Length;
-        var i = 0;
-        var j = 1;
-        while (j < nums.Length)
+        int cnt = 0;
+        int n = nums.Length;
+        for (int i = 1; i < n; ++i)
         {
-            if (nums[i] != nums[j])
+            if (nums[i] == nums[i - 1])
             {
-                nums[++i] = nums[j];
+                ++cnt;
+            }
+            else
+            {
+                nums[i - cnt] = nums[i];
             }
-            ++j;
         }
-        return i + 1;
+        return n - cnt;
     }
 }