feat: add solutions to leetcode problem: No.0026

Author: yanglbme

README.md

@@ -52,6 +52,7 @@
 
 ### 数组
 
+- [删除排序数组中的重复项](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README.md)
 - [移除元素](/solution/0000-0099/0027.Remove%20Element/README.md)
 - [移动零](/solution/0200-0299/0283.Move%20Zeroes/README.md)
 - [数组中重复的数字](/lcof/面试题03.%20数组中重复的数字/README.md)

README_EN.md

@@ -52,6 +52,7 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 
 ### Arrays
 
+- [Remove Duplicates from Sorted Array](/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md)
 - [Remove Element](/solution/0000-0099/0027.Remove%20Element/README_EN.md)
 - [Move Zeroes](/solution/0200-0299/0283.Move%20Zeroes/README_EN.md)
 - [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md)

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

@@ -59,15 +59,50 @@ for (int i = 0; i < len; i++) {
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        cnt, n = 0, len(nums)
+        for i in range(1, n):
+            if nums[i] == nums[i - 1]:
+                cnt += 1
+            else:
+                nums[i - cnt] = nums[i]
+        return n - cnt
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int cnt = 0, n = nums.length;
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] == nums[i - 1]) ++cnt;
+            else nums[i - cnt] = nums[i];
+        }
+        return n - cnt;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function (nums) {
+  let cnt = 0;
+  const n = nums.length;
+  for (let i = 1; i < n; ++i) {
+    if (nums[i] == nums[i - 1]) ++cnt;
+    else nums[i - cnt] = nums[i];
+  }
+  return n - cnt;
+};
 ```
 
 ### **...**

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

@@ -71,13 +71,48 @@ for (int i = 0; i < len; i++) {
 ### **Python3**
 
 ```python
-
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        cnt, n = 0, len(nums)
+        for i in range(1, n):
+            if nums[i] == nums[i - 1]:
+                cnt += 1
+            else:
+                nums[i - cnt] = nums[i]
+        return n - cnt
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int cnt = 0, n = nums.length;
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] == nums[i - 1]) ++cnt;
+            else nums[i - cnt] = nums[i];
+        }
+        return n - cnt;
+    }
+}
+```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function (nums) {
+  let cnt = 0;
+  const n = nums.length;
+  for (let i = 1; i < n; ++i) {
+    if (nums[i] == nums[i - 1]) ++cnt;
+    else nums[i - cnt] = nums[i];
+  }
+  return n - cnt;
+};
 ```
 
 ### **...**

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

@@ -1,15 +1,10 @@
 class Solution {
     public int removeDuplicates(int[] nums) {
-        if(nums == null || nums.length == 0) {
-            return 0;
+        int cnt = 0, n = nums.length;
+        for (int i = 1; i < n; ++i) {
+            if (nums[i] == nums[i - 1]) ++cnt;
+            else nums[i - cnt] = nums[i];
         }
-        
-        int j = 0;
-        for(int i = 1; i < nums.length; i++) {
-            if(nums[i] != nums[j]) { 
-                nums[++j] = nums[i];
-            }
-        }
-        return j + 1;
+        return n - cnt;
     }
 }

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

@@ -1,18 +1,13 @@
-const removeDuplicates = function (nums) {
-  let i = 1;
-  let t = 0;
-  let t2 = nums[0];
-  let res = 1;
-  let length = nums.length;
-  for (let k = 1; k < length; k++) {
-    if (nums[k] - nums[k - 1] !== 0 && nums[k] !== t2) {
-      t2 = nums[k];
-      t = nums[i];
-      nums[i] = nums[k];
-      nums[k] = t;
-      i++;
-      res++;
-    }
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function (nums) {
+  let cnt = 0;
+  const n = nums.length;
+  for (let i = 1; i < n; ++i) {
+    if (nums[i] == nums[i - 1]) ++cnt;
+    else nums[i - cnt] = nums[i];
   }
-  return res;
+  return n - cnt;
 };

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

@@ -1,14 +1,9 @@
-#48ms
-class Solution(object):
-    def removeDuplicates(self, nums):
-        if not nums:
-            return 0
-        
-        newtail = 0
-        
-        for i in range(1, len(nums)):
-            if nums[i] != nums[newtail]:
-                newtail += 1
-                nums[newtail] = nums[i] #只要求字符串前段正确即可
-                
-        return newtail + 1   #要求返回新字符串长度   
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        cnt, n = 0, len(nums)
+        for i in range(1, n):
+            if nums[i] == nums[i - 1]:
+                cnt += 1
+            else:
+                nums[i - cnt] = nums[i]
+        return n - cnt