refactor 283

fishercoder1534 · fishercoder1534 · commit 8010a74eb2bc · 2021-09-14T14:38:07.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_283.java b/src/main/java/com/fishercoder/solutions/_283.java
@@ -19,7 +19,7 @@ public void moveZeroes(int[] nums) {
 
     public static class Solution2 {
         public void moveZeroes(int[] nums) {
-            //this solutoin is the most optimal since it minimizes the number of operations
+            //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 i = 0, j = 0; i < nums.length && j < nums.length; j++) {
                 if (nums[j] != 0) {
