[LeetCode] 038: Jump Game

最新推荐文章于 2019-08-10 09:36:27 发布

原创最新推荐文章于 2019-08-10 09:36:27 发布 · 3.5k 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode2 专栏收录该内容

140 篇文章

订阅专栏

本文介绍了一个经典的跳过数组问题，即判断是否能从数组的起始位置到达末尾。通过一个具体的C++解决方案，详细解释了如何使用动态规划来解决这一问题。举例说明了当输入为A=[2,3,1,1,4]时返回true，而A=[3,2,1,0,4]时返回false。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

[Problem]

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.

[Solution]

class Solution {
public:
    bool canJump(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        // empty
        if(n <= 0)return false;
        
        // initial
        bool *dp = new bool[n];
        dp[n-1] = true;
        for(int i = n-2; i >= 0; --i){
            dp[i] = false;
            int k = 1;	// length of the step to jump
            while(k <= A[i] && i + k < n){
                if(i+k == n-1 || dp[i+k]){
                    dp[i] = true;
                    break;
                }
                else if(!dp[i+k]){
                    k += A[i+k] + 1;
                }
            }
        }
	    return dp[0];
    }
};