Merge pull request #3109 from Xiaopeng-Sam-Luo/new_branch

create solution to 2348 number of zero filled subarray.js & solution to 0080 remove-duplicates-from-sorted-array-ii.java

Author: Ykhan799

Diff for: java/0080-remove-duplicates-from-sorted-array-ii.java

@@ -1,3 +1,29 @@
+/*
+ * Time Complexity: O(n);
+ * Space Complexity: O(1);
+ */
+
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        int count = 1;
+        int index1 = 0;
+        for (int i = 1; i < nums.length; i++) {
+            if (nums[i] != nums[index1]) {
+                count = 1;
+                index1++;
+                nums[index1] = nums[i];
+            } else {
+                count++;
+                if (count <= 2) {
+                    index1++;                    
+                    nums[index1] = nums[i];
+                }
+            };
+        };
+        return index1 + 1;
+    }
+}
+
 class Solution {
     public int removeDuplicates(int[] nums) {
         int k = 0;
@@ -8,4 +34,5 @@ public int removeDuplicates(int[] nums) {
         }
         return k;
     }
-}
+}
+

Diff for: javascript/2348-number-of-zero-filled-subarrays.js

@@ -20,6 +20,7 @@
  * @param {number[]} nums
  * @return {number}
  */
+
 let zeroFilledSubarray = function (nums) {
     let result = 0;
     let count = 0;
@@ -31,4 +32,4 @@ let zeroFilledSubarray = function (nums) {
     }
 
     return result;
-};
+};