LeetCode 0055 - Jump Game

Reck Zhang

发布于 2021-08-11 10:37:01

2600

发布于 2021-08-11 10:37:01

文章被收录于专栏：Reck Zhang

Jump Game

Desicription

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.

For example:

A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

Solution

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int len = nums.size();
        if(len < 2)
            return 1;
        int curFarthest = 0;
        int curEnd = 0;
        for(int i = 0; i < len; i++){
            if(i > curFarthest)
                return 0;
            curFarthest = max(curFarthest, i + nums[i]);
            if(curFarthest >= len - 1)
                return 1;
            if(i == curEnd)
                curEnd = curFarthest;
        }
        return 0;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-13，如有侵权请联系 cloudcommunity@tencent.com 删除

each