【Leetcode】Jump Game

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

转载最新推荐文章于 2025-05-22 14:52:23 发布 · 55 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/dengeven/p/3739485.html

本文介绍了一种使用C++解决跳跃游戏问题的方法，通过维护一个reach变量来跟踪可以达到的最远位置，实现从数组起始位置跳到最后一个元素的判断。

摘要生成于 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.

 1 class Solution {
 2 public:
 3     bool canJump(int A[], int n) {
 4         int reach = 0;
 5         for (int i = 0; i <= reach && i < n; ++i) {
 6             reach = max(reach, A[i] + i);
 7             if (reach >= n - 1) {
 8                 return true;
 9             }
10         }
11         return reach >= n - 1;
12     }
13 };