leetcode练习 Jump Game

最新推荐文章于 2018-10-18 23:17:38 发布

那个字念颀

最新推荐文章于 2018-10-18 23:17:38 发布

阅读量164

点赞数

分类专栏：学习

本文链接：https://blog.csdn.net/weixin_38351756/article/details/79024686

版权

学习专栏收录该内容

33 篇文章 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.

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