add a solution for 26

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_26.java

@@ -1,18 +1,43 @@
 package com.fishercoder.solutions;
 
+import com.fishercoder.common.utils.CommonUtils;
+
 public class _26 {
 
-  public static class Solution1 {
-    /**Key: It doesn't matter what you leave beyond the returned length.*/
-    public int removeDuplicates(int[] nums) {
-      int i = 0;
-      for (int j = 1; j < nums.length; j++) {
-        if (nums[i] != nums[j]) {
-          i++;
-          nums[i] = nums[j];
+    public static class Solution1 {
+        /**
+         * Key: It doesn't matter what you leave beyond the returned length.
+         */
+        public int removeDuplicates(int[] nums) {
+            int i = 0;
+            for (int j = 1; j < nums.length; j++) {
+                if (nums[i] != nums[j]) {
+                    i++;
+                    nums[i] = nums[j];
+                }
+            }
+            return i + 1;
         }
-      }
-      return i + 1;
     }
-  }
+
+    public static class Solution2 {
+        /**
+         * My completely original solution on 2/2/2022.
+         */
+        public int removeDuplicates(int[] nums) {
+            int left = 0;
+            int right = 1;
+            for (; right < nums.length; right++) {
+                while (right < nums.length && nums[right] == nums[right - 1]) {
+                    right++;
+                }
+                if (right < nums.length) {
+                    nums[++left] = nums[right];
+                }
+            }
+            CommonUtils.printArray(nums);
+            return left + 1;
+        }
+    }
+
 }

src/test/java/com/fishercoder/_26Test.java

@@ -8,17 +8,20 @@
 
 public class _26Test {
     private static _26.Solution1 solution1;
+    private static _26.Solution2 solution2;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _26.Solution1();
+        solution2 = new _26.Solution2();
     }
 
     @Test
     public void test1() {
         nums = new int[]{1, 1, 2};
         assertEquals(2, solution1.removeDuplicates(nums));
+        assertEquals(2, solution2.removeDuplicates(nums));
     }
 
     @Test