Merge pull request neetcode-gh#3038 from benmak11/remove-dups

Ykhan799 · web-flow · commit 2bc2fd90282b · 2024-11-09T13:36:26.000-07:00
Create 0080-remove-duplicates-from-sorted-array-ii.java
diff --git a/java/0080-remove-duplicates-from-sorted-array-ii.java b/java/0080-remove-duplicates-from-sorted-array-ii.java
@@ -1,3 +1,24 @@
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int l = 0, r = 0, n = nums.length;
+
+        while (r < n) {
+            int count = 1;
+            while (r + 1 < n && nums[r] == nums[r + 1]) {
+                r++;
+                count++;
+            }
+
+            for (int i = 0; i < Math.min(2, count); i++) {
+                nums[l] = nums[r];
+                l++;
+            }
+            r++;
+        }
+        return l;
+    }
+}
+
 /*
  * Time Complexity: O(n);
  * Space Complexity: O(1);
@@ -36,3 +57,4 @@ public int removeDuplicates(int[] nums) {
     }
 }
 
+
