[Leetcode] Jump Game

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

weixin_34082177

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

阅读量47

点赞数

本文探讨了一个经典的算法问题：跳跃游戏。通过分析数组中每个元素所代表的跳跃长度，判断是否能从起始位置到达终点。文章提供了一种高效算法，通过记录当前能达到的最远位置来简化问题，实现快速判断。

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 < n; ++i) {
 6             if (i <= reach) {
 7                 reach = (i + A[i]) > reach ? (i + A[i]) : reach;
 8             } else {
 9                 return false;
10             }
11         }
12         return true;
13     }
14 };