[056] LeetCode 45演算法【Jump Game II】跳躍遊戲 II

45. Jump Game II (Hard)

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Your goal is to reach the last index in the minimum number of jumps.

Example:

Input: [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2.
Jump 1 step from index 0 to 1, then 3 steps to the last index.

Note:

You can assume that you can always reach the last index.

這一題是上一題的follow up，差別在於要找到跳最小的步數，這題一樣可以用貪心法去解，在過程中記錄能走最遠的步數就可以。

大家加油。

上一篇：[055] LeetCode 55演算法【Jump Game】 跳躍遊戲

下一篇：[057] LeetCode 121 演算法【Best Time to Buy and Sell Stock】 股票機器人