#Leetcode# 55. Jump Game

本文探讨了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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值