#Leetcode# 55. Jump Game

最新推荐文章于 2025-08-15 16:44:13 发布

转载最新推荐文章于 2025-08-15 16:44:13 发布 · 100 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zlrrrr/p/10012039.html

文章标签：

#数据结构与算法

本文探讨了LeetCode上的“Jump Game”问题，通过使用贪心算法维护最远到达距离来判断是否能到达数组末尾。示例输入[2,3,1,1,4]返回true，而[3,2,1,0,4]返回false，详细解析了算法思路及代码实现。

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

https://leetcode.com/problems/jump-game/

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.

题解：贪心维护最远到达的距离

代码：

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

转载于:https://www.cnblogs.com/zlrrrr/p/10012039.html