[leetcode]Jump Game &&Jump Game II

Jump Game题目描述：

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.

思路：

刚开始在A[0]处，可以走的最大步数maxStep为A[0]，遍历数组，maxStep递减，并根据当前位置的值更新可以走的maxStep。如果maxStep不为正数，则返回false。

代码如下

class Solution {
public:
    bool canJump(int A[], int n) {
        vector<int> f(n,0);
        int maxStep=A[0];
        for(int i=1;i<n;i++){
            if(maxStep>0){
                maxStep--;
                maxStep=max(maxStep,A[i]);
            }
            else{
                return false;
            }
        }
         return true;
    }
};

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

思路：

题目要求能到达最右边的最小步数，不过没有要求怎么走的。可以使用贪心算法，用cur_max_step代表当前可走到的最右位置，遍历数组，不断根据当前位置更新之后可到达的最右位置，当当前位置i>cur_max_step，即走不到当前位置时，step增加，更新当前可走到的最右位置。

代码如下：

class Solution {
public:
    int jump(int A[], int n) {
        if(n==1){
            return 0;
        }
        int step=0;
        int cur_max_step=0;
        int next_max_step=0;
        
        for(int i=0;i<n;i++){
            if(i>cur_max_step){
                step++;
                cur_max_step=next_max_step;
            }
            next_max_step=max(A[i]+i,next_max_step);
        }
        
        return step;
    }
};