add a solution for 283

fishercoder1534 · fishercoder1534 · commit 19492cbb288a · 2021-10-22T15:32:49.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_283.java b/src/main/java/com/fishercoder/solutions/_283.java
@@ -54,4 +54,26 @@ public void moveZeroes(int[] nums) {
         }
     }
 
+    public static class Solution4 {
+        /**
+         * I'm glad that I finally figured this one out completely on my own, this O(n) time, O(1) space solution.
+         */
+        public void moveZeroes(int[] nums) {
+            int i = 0;//zero index
+            int j = 0;//non zero index
+            while (i < nums.length && j < nums.length) {
+                if (nums[j] != 0) {
+                    if (i < j) {
+                        nums[i] = nums[j];
+                        nums[j] = 0;
+                    }
+                }
+                j++;
+                while (i < nums.length && nums[i] != 0) {
+                    i++;
+                }
+            }
+        }
+    }
+
 }
diff --git a/src/test/java/com/fishercoder/_283Test.java b/src/test/java/com/fishercoder/_283Test.java
@@ -11,13 +11,15 @@ public class _283Test {
     private static _283.Solution1 solution1;
     private static _283.Solution2 solution2;
     private static _283.Solution3 solution3;
+    private static _283.Solution4 solution4;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _283.Solution1();
         solution2 = new _283.Solution2();
         solution3 = new _283.Solution3();
+        solution4 = new _283.Solution4();
     }
 
     @Test
@@ -124,4 +126,11 @@ public void test15() {
         solution3.moveZeroes(nums);
         assertArrayEquals(new int[]{1, 1, 0}, nums);
     }
+
+    @Test
+    public void test16() {
+        nums = new int[]{2, 1};
+        solution4.moveZeroes(nums);
+        assertArrayEquals(new int[]{2, 1}, nums);
+    }
 }
