update 283 again

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/firstthousand/_283.java

@@ -22,13 +22,11 @@ public static class Solution2 {
         public void moveZeroes(int[] nums) {
             // this solution is the most optimal since it minimizes the number of operations
             // the idea is to swap the non-zero element to the first zero number position
-            for (int nonZeroIndex = 0, zeroIndex = 0;
-                    nonZeroIndex < nums.length && zeroIndex < nums.length;
-                    zeroIndex++) {
-                if (nums[zeroIndex] != 0) {
-                    int temp = nums[nonZeroIndex];
-                    nums[nonZeroIndex++] = nums[zeroIndex];
-                    nums[zeroIndex] = temp;
+            for (int insertPos = 0, curr = 0; curr < nums.length; curr++) {
+                if (nums[curr] != 0) {
+                    int temp = nums[insertPos];
+                    nums[insertPos++] = nums[curr];
+                    nums[curr] = temp;
                 }
             }
         }