55. Jump Game && 45. 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.

Determine if you are able to reach the last index.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

贪婪。在每一个位置，记录能到达的最远距离range；在range以内不断更新range = Math.max(range, i + nums[i])。遍历i，如果存在i > range,即当前range到达不了，返回false。

public class Solution {
    public boolean canJump(int[] nums) {
        int range = 0;
        for(int i = 0; i < nums.length;i++){
            if(i > range) return false;
            range = Math.max(i+nums[i],range);
        }
        return true;
    }
}

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

Note:
You can assume that you can always reach the last index.
贪婪。
当前一跳jump能到达的范围为假设为[left,lastrange]，从上一跳的到达范围[left,lastrange]出发，jump+1跳能到达的距离用max记录，一旦遍历完[left,lastrange]，jump+1跳能到达的范围也就可以确定，为[lastrange,max];再次触发下一跳。
代码如下

public class Solution {
    public int jump(int[] A) {
        //jump代表到达i所需的最小步数
        //lastrange代表minjump能到达的最远距离
         int jump = 0;
         int lastrange = 0;
         int max = 0;
         for(int i = 0;i < A.length-1;i++){
             max = Math.max(A[i]+i,max);
             if(i == lastrange){
                 jump++;
                 lastrange = max;
             }
         }
         return jump;
    }
}