45 Jump Game II

题目链接：https://leetcode.com/problems/jump-game-ii/

题目：

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.

For example:
Given array A = [2,3,1,1,4]

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.)

解题思路：
一开始用递归回溯，结果超时了。看了tag，发现考点是贪心算法，不会。参考了网上大牛的思路。
参考链接：http://46aae4d1e2371e4aa769798941cef698.devproxy.yunshipei.com/linhuanmars/article/details/21356187

代码如下：

public class Solution {
    public int jump(int[] nums) {
        if(nums == null || nums.length == 0)
            return 0;
        int reach = 0;
        int lastReach = 0;
        int step = 0;
        for(int i = 0; i <= reach && i < nums.length; i ++) {
            if(i > lastReach) {
                step ++;
                lastReach = reach;
            }
            reach = Math.max(reach, nums[i] + i);
        }
        if(reach < nums.length - 1)
            return 0;
        return step;
    }
}

91 / 91 test cases passed.
Status: Accepted
Runtime: 392 ms