Leetcode Week6 Jump Game

最新推荐文章于 2025-07-23 09:59:13 发布

转载最新推荐文章于 2025-07-23 09:59:13 发布 · 112 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/thougr/p/10206932.html

本文解析了一个经典的算法问题：跳跃游戏。通过分析给定数组中每个元素代表的最大跳跃长度，判断是否能从数组的起始位置到达最后一个元素。文章提供了一个简洁的C++实现方案，通过动态更新最大跳跃范围来高效解决问题。

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

Question

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.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
             jump length is 0, which makes it impossible to reach the last index.

Answer

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int maxJump = 0;
        for (int i = 0; i < nums.size(); i++) {
            if (i <= maxJump) {
                maxJump = max(maxJump, i+nums[i]);
            }
        }
        return maxJump >= nums.size()-1;
    }
};