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.

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

楸到底终点的最短路径长度。

用一个left和right表示区间，在该区间计算得到能到达的新区间，知道到达终点为止。

代码：

public class Solution {
    public int jump(int[] nums) {
        int left=0,right=0,step=0;
        if(nums.length==1)return 0;
        while(left<=right)
        {
        	step++;
        	int old_right=right;
        	for(int i=left;i<=old_right;i++)
        	{
        		int new_right=i+nums[i];
        		if(new_right>=nums.length-1)return step;
        		if(new_right>right)right=new_right;
        	}
        	left=old_right+1;
        }
        return 0;
    }
}