LeetCode·55. Jump Game

最新推荐文章于 2022-05-06 18:43:23 发布

seuStones

最新推荐文章于 2022-05-06 18:43:23 发布

阅读量147

点赞数

分类专栏： Informal essay

本文链接：https://blog.csdn.net/u010189457/article/details/81380720

版权

Informal essay 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

题目：

55. 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 curJump = 0;
        for(int i = 0; i < nums.size()-1; ++i, --curJump){   
            if(curJump >= 0){
                if(curJump < nums[i]) curJump = nums[i];  
            }else{
                return false;  
            }
        }

        return curJump >= 0;
    }
};