leetcode_c++：Jump Game II（045）

题目

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

---

算法_1

• 贪心算法
• O(N)

[2,3,1,1,4]， 这里首先maxreach = 2，那么第一步的时候，可以达到3，和1，最大的是3，所以这里选择贪心的思路，走到3.然后在3的范围内找maxreach，然后继续贪心走到目标。。。。

只需要时刻计算前位置和当前位置所能跳的最远长度,并始终和n作比较就可以:

维护一个farthest变量，每次在遍历start到end之间的元素，尝试更新farthest变量
start = end + 1
end = farthest
比较end时候大于数组长度，大于返回结果，否则steps += 1

---

#include<iostream>
#include<vector>
#include <algorithm>

using namespace std;


// 贪心算法
class Solution{
    public:
    int jump(int A[],int n){
        int reach=1;
        int step=0;
        for(int i=0;i<reach && reach<n;){
            int farthest=reach; //the farthest pos prev step can go
            while(i<farthest){  //reach as far as possible this step
                reach =max(reach,i+1+A[i]);
                ++i;

            }
            step++;
        }

        if(reach>=n)
            return step;
        else
            return 0;
    }

};