【算法】【Greedy】Jump Game

最新推荐文章于 2021-01-06 17:16:59 发布

雾语o-o

最新推荐文章于 2021-01-06 17:16:59 发布

阅读量258

点赞数

分类专栏：算法分析与设计文章标签：算法分析与设计

本文链接：https://blog.csdn.net/wurlin/article/details/78915377

版权

算法分析与设计专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Difficulty:Medium

Description

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

我参考了Linear and simple solution in C++ ，过程比较简单，所以直接上我的代码。

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int jumpto = 0, i, n = nums.size();  // jumpto记录目前可以跳到的最大的索引号
        for (i = 0; i < n && i <= jumpto; ++i) {
        // i若大于jumpto，说明我们最远只能跳到jumpto的位置（索引），即不能跳到最后一个索引

            jumpto = jumpto < i + nums[i] ? i + nums[i] : jumpto;
        }
        return i == n;
    }
};