55. Jump Game

无名_1989

于 2018-04-06 20:26:15 发布

阅读量184

点赞数

本文介绍了一个编程问题：从数组的第一个元素开始，每个元素代表从该位置能跳跃的最大长度，判断是否能到达数组的最后一个元素。提供了一种解决方案，并通过实例进行说明。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        std::vector<int> index;
        for(int i=0; i<nums.size(); i++)
        {
            index.push_back(i+nums[i]);
        }
        int jump = 0;
        int max_index = index[0];
        while(jump<index.size()&&jump<=max_index)
        {
            if(max_index<index[jump])
            {
                max_index = index[jump];
            }
            jump++;
        }
        if(jump == index.size())
        {
            return true;
        }
        return false;
    }
};