Jump Game

最新推荐文章于 2025-05-22 14:52:23 发布

原创最新推荐文章于 2025-05-22 14:52:23 发布 · 986 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode记录专栏收录该内容

79 篇文章

订阅专栏

本文探讨如何通过数组元素表示跳跃长度，解决从第一个位置到达最后一个位置的路径问题。通过实例演示，读者可以掌握如何判断是否能成功完成跳跃游戏。

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

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.

class Solution {
public:
    bool canJump(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (A[0] == 0 && n > 1) {
            return false;
        }
        for (int i = 1; i < n; ++i) {
            A[i] = A[i] + i > A[i-1] ? A[i] + i : A[i-1];
            if (A[i] == i && i != n-1) {
                return false;
            }
        }
        return true;
    }
};