55. Jump Game

最新推荐文章于 2025-09-10 15:16:07 发布

weixin_30808575

最新推荐文章于 2025-09-10 15:16:07 发布

阅读量51

点赞数

CC 4.0 BY-SA版权

文章标签： c/c++ runtime

原文链接：http://www.cnblogs.com/ruruozhenhao/p/9814678.html

本文探讨了在给定非负整数数组中，每个元素代表当前位置的最大跳跃长度，判断是否能从数组起始位置到达末尾的问题。通过示例说明了算法的实现过程，并提供了一段C++代码解决方案，该方案在在线提交中表现优秀，运行时间为8ms，超过98.95%的提交。

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.

AC code:

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

Runtime: 8 ms, faster than 98.95% of C++ online submissions for Jump Game.

转载于:https://www.cnblogs.com/ruruozhenhao/p/9814678.html