refactor 45

fishercoder1534 · fishercoder1534 · commit 6567f67c24e2 · 2021-09-16T12:07:41.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_45.java b/src/main/java/com/fishercoder/solutions/_45.java
@@ -3,17 +3,20 @@
 public class _45 {
     public static class Solution1 {
         public int jump(int[] nums) {
-            int stepCount = 0;
+            int jumps = 0;
             int lastJumpMax = 0;
             int currentJumpMax = 0;
             for (int i = 0; i < nums.length - 1; i++) {
                 currentJumpMax = Math.max(currentJumpMax, i + nums[i]);
                 if (i == lastJumpMax) {
-                    stepCount++;
+                    jumps++;
                     lastJumpMax = currentJumpMax;
                 }
+                if (lastJumpMax >= nums.length) {
+                    return jumps;
+                }
             }
-            return stepCount;
+            return jumps;
         }
     }
 }
diff --git a/src/test/java/com/fishercoder/_45Test.java b/src/test/java/com/fishercoder/_45Test.java
@@ -7,17 +7,17 @@
 import static org.junit.Assert.assertEquals;
 
 public class _45Test {
-  private static _45.Solution1 solution1;
-  private static int[] nums;
+    private static _45.Solution1 solution1;
+    private static int[] nums;
 
-  @BeforeClass
-  public static void setup() {
-    solution1 = new _45.Solution1();
-  }
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _45.Solution1();
+    }
 
-  @Test
-  public void test1() {
-    nums = new int[] {2, 3, 1, 1, 4};
-    assertEquals(2, solution1.jump(nums));
-  }
+    @Test
+    public void test1() {
+        nums = new int[]{2, 3, 1, 1, 4};
+        assertEquals(2, solution1.jump(nums));
+    }
 }

Original file line number	Diff line number	Diff line change
`@@ -3,17 +3,20 @@`
`3`	`3`	`public class _45 {`
`4`	`4`	`public static class Solution1 {`
`5`	`5`	`public int jump(int[] nums) {`
`6`		`- int stepCount = 0;`
	`6`	`+ int jumps = 0;`
`7`	`7`	`int lastJumpMax = 0;`
`8`	`8`	`int currentJumpMax = 0;`
`9`	`9`	`for (int i = 0; i < nums.length - 1; i++) {`
`10`	`10`	`currentJumpMax = Math.max(currentJumpMax, i + nums[i]);`
`11`	`11`	`if (i == lastJumpMax) {`
`12`		`- stepCount++;`
	`12`	`+ jumps++;`
`13`	`13`	`lastJumpMax = currentJumpMax;`
`14`	`14`	`}`
	`15`	`+ if (lastJumpMax >= nums.length) {`
	`16`	`+ return jumps;`
	`17`	`+ }`
`15`	`18`	`}`
`16`		`- return stepCount;`
	`19`	`+ return jumps;`
`17`	`20`	`}`
`18`	`21`	`}`
`19`	`22`	`}`