Commit 5995bda

committed

solves jump game ii

1 parent bb2a15e commit 5995bdaCopy full SHA for 5995bda

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -45,6 +45,7 @@`
`45`	`45`	`\| 39 \| [Combination Sum](https://leetcode.com/problems/combination-sum) \| [![Java](assets/java.png)](src/CombinationSum.java) \| \|`
`46`	`46`	`\| 40 \| [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) \| [![Java](assets/java.png)](src/CombinationSumII.java) \| \|`
`47`	`47`	`\| 43 \| [Multiply Strings](https://leetcode.com/problems/multiply-strings) \| [![Java](assets/java.png)](src/MultiplyStrings.java) \| \|`
	`48`	`+\| 45 \| [Jump Game II](https://leetcode.com/problems/jump-game-ii) \| [![Java](assets/java.png)](src/JumpGameII.java) \| \|`
`48`	`49`	`\| 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) \| \|`
`49`	`50`	`\| 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) \| \|`
`50`	`51`	`\| 66 \| [Plus One](https://leetcode.com/problems/plus-one) \| [![Java](assets/java.png)](src/PlusOne.java) [![Python](assets/python.png)](python/plus_one.py) \| \|`

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,24 @@`
	`1`	`+// https://leetcode.com/problems/jump-game-ii`
	`2`	`+// T: O(n)`
	`3`	`+// S: O(1)`
	`4`	`+`
	`5`	`+public class JumpGameII {`
	`6`	`+ public int jump(int[] nums) {`
	`7`	`+ if (nums.length == 1) return 0;`
	`8`	`+`
	`9`	`+ int jumps = 0;`
	`10`	`+ for (int current = 0 ; current < nums.length ; jumps++) {`
	`11`	`+ int maxJumpIndex = current, maxJump = nums[current];`
	`12`	`+ for (int i = current ; i < current + nums[current] + 1 && i < nums.length ; i++) {`
	`13`	`+ if (i == nums.length - 1) return jumps + 1;`
	`14`	`+ int potential = i - current + nums[i];`
	`15`	`+ if (potential > maxJump) {`
	`16`	`+ maxJump = potential;`
	`17`	`+ maxJumpIndex = i;`
	`18`	`+ } else if (potential == maxJump) maxJumpIndex = i;`
	`19`	`+ }`
	`20`	`+ current = maxJumpIndex;`
	`21`	`+ }`
	`22`	`+ return jumps;`
	`23`	`+ }`
	`24`	`+}`

Comments

(0)