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

思想：

本题可以采用贪心算法的思想，每次尽可能多的jump max distance from one region (old-last,last) to anther (last,curr).

代码：

class Solution {
public:
int jump(vector<int>& nums) {
int len = nums.size();
int start = 0;//每一跳的起始位置
int end = 0;//每一跳的终止位置
int jumps = 0;//跳数
for (int i = 0; i < len; i++)
{
if (i > end)
{
end = start;
jumps++;
}
start = max(start, i + nums[i]);
}
return jumps;
}
};