Leetcode: Jump Game

最新推荐文章于 2022-04-26 15:27:54 发布

logic_nut

最新推荐文章于 2022-04-26 15:27:54 发布

阅读量799

点赞数

分类专栏：面试题

本文链接：https://blog.csdn.net/logic_nut/article/details/13504409

版权

面试题专栏收录该内容

50 篇文章 0 订阅

订阅专栏

http://oj.leetcode.com/problems/jump-game/

class Solution {
public:
    // Don't code too fast
    // The bad dp algorithm below (commented out) has the complexity of O(N*N)
    /*bool search(int A[], int n, int current, vector<int> &dp){
        if(dp[current]!=-1) return dp[current]==1;
        dp[current]=0;
        for(int last=min(n-1, current+A[current]);last>current;last--){
            if(search(A,n,last,dp)){
                dp[current]=1;
                break;
            }
        }
        return dp[current]==1; 
    }
    bool canJump(int A[], int n) {
        vector<int> dp;
        // -1 unknown  0 unreachable 1 reachable
        for(int i=0;i<n-1;i++) dp.push_back(-1);
        dp.push_back(1);
        return search(A,n,0,dp);
    }*/
    bool canJump(int A[], int n) {
        int lowestIndex=n-1;
        for(int i=n-2;i>=0;i--){
            if((i+A[i])>=lowestIndex) lowestIndex=i;
        }
        return lowestIndex==0;
    }
};