LeetCode OJ:Jump Game

最新推荐文章于 2024-09-30 23:49:04 发布

_王川

最新推荐文章于 2024-09-30 23:49:04 发布

阅读量950

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/starcuan/article/details/18854201

版权

LeetCode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

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.

算法思想：

用贪心策略，刚开始step = A[0]，到下一步step--, 并且取step = max(step, A[1])，这样step一直是保持最大的能移动步数，局部最优也是全局最优。

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

answer2:

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

动态规划：

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