solves jump game ii

Author: anishLearnsToCode

README.md

@@ -45,6 +45,7 @@
 |  39  | [Combination Sum](https://leetcode.com/problems/combination-sum)                                                                                          |                                                                 [![Java](assets/java.png)](src/CombinationSum.java)                                                                  |                                                                                                                                   |
 |  40  | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii)                                                                                    |                                                                [![Java](assets/java.png)](src/CombinationSumII.java)                                                                 |                                                                                                                                   |
 |  43  | [Multiply Strings](https://leetcode.com/problems/multiply-strings)                                                                                        |                                                                 [![Java](assets/java.png)](src/MultiplyStrings.java)                                                                 |                                                                                                                                   |
+|  45  | [Jump Game II](https://leetcode.com/problems/jump-game-ii)                                                                                                |                                                                   [![Java](assets/java.png)](src/JumpGameII.java)                                                                    |                                                                                                                                   |
 |  53  | [Maximum SubArray](https://leetcode.com/problems/maximum-subarray)                                                                                        |                                 [![Java](assets/java.png)](src/MaximumSubArray.java) [![Python](assets/python.png)](python/maximum_sum_subarray.py)                                  |                                                                                                                                   |
 |  58  | [Length of Last Word](https://leetcode.com/problems/length-of-last-word)                                                                                  |                                 [![Java](assets/java.png)](src/LengthOfLastWord.java) [![Python](assets/python.png)](python/length_of_last_word.py)                                  |                                                                                                                                   |
 |  66  | [Plus One](https://leetcode.com/problems/plus-one)                                                                                                        |                                           [![Java](assets/java.png)](src/PlusOne.java) [![Python](assets/python.png)](python/plus_one.py)                                            |                                                                                                                                   |

src/JumpGameII.java

@@ -0,0 +1,24 @@
+// https://leetcode.com/problems/jump-game-ii
+// T: O(n)
+// S: O(1)
+
+public class JumpGameII {
+    public int jump(int[] nums) {
+        if (nums.length == 1) return 0;
+
+        int jumps = 0;
+        for (int current = 0 ; current < nums.length ; jumps++) {
+            int maxJumpIndex = current, maxJump = nums[current];
+            for (int i = current ; i < current + nums[current] + 1 && i < nums.length ; i++) {
+                if (i == nums.length - 1) return jumps + 1;
+                int potential = i - current + nums[i];
+                if (potential > maxJump) {
+                    maxJump = potential;
+                    maxJumpIndex = i;
+                } else if (potential == maxJump) maxJumpIndex = i;
+            }
+            current = maxJumpIndex;
+        }
+        return jumps;
+    }
+}