LeetCode | 55. Jump Game

最新推荐文章于 2024-04-19 11:01:49 发布

PKU_CXK

最新推荐文章于 2024-04-19 11:01:49 发布

阅读量267

点赞数 1

分类专栏：算法模拟 LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/pku_Coder/article/details/74133923

版权

算法同时被 3 个专栏收录

89 篇文章 8 订阅

订阅专栏

LeetCode

82 篇文章 0 订阅

订阅专栏

模拟

19 篇文章 0 订阅

订阅专栏

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.

思路：用reach记录可以到达的范围，并不断更新；it记录当前的位置。最后判断it能否到达最后一个位置

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int len = nums.size();
        int reach = 0, it = 0;
        while(it<len && it<=reach)
        {
            reach = max(reach,it+nums[it]);
            it++;
        }
        return it==len;
    }
};