leetcode-55-Jump Game

最新推荐文章于 2020-07-21 21:04:47 发布

carol23333

最新推荐文章于 2020-07-21 21:04:47 发布

阅读量144

点赞数

本文链接：https://blog.youkuaiyun.com/qq_32147019/article/details/80647488

版权

本文介绍了一个判断能否通过跳跃到达数组末端的游戏算法实现。通过记录每一步能跳到的最大位置，来决定是否能够达到最后一个元素。提供了详细的代码示例，并通过两个实例展示了算法的工作原理。

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

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int length = nums.size();
        if(length == 1) return true;
        vector<int> global(length); //走到第i格的时候所能跳到的最大值
        global[0] = nums[0];

        for(int i=1;i<length;i++){
            if(global[i-1] >= i)
                global[i] = max(global[i-1], i+nums[i]);
            if(global[i]>=length-1)
                return true;
        }
        return false;
    }
};

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.