55. Jump Game

最新推荐文章于 2024-01-03 13:10:00 发布

原创最新推荐文章于 2024-01-03 13:10:00 发布 · 117 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

56 篇文章

订阅专栏

本文深入解析了一种称为“跳跃游戏”的算法问题，该问题要求判断是否能从数组的起始位置通过一系列跳跃达到末尾。文章详细介绍了算法的实现思路，通过计算可达的最大索引值来确定是否能够完成整个跳跃过程。

55. Jump Game

Medium

2562244FavoriteShare

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.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
             jump length is 0, which makes it impossible to reach the last index.

Accepted

323,059

Submissions

985,431

/*#include<bits/stdc++.h>
using namespace std;*/
bool canJump(vector<int>& nums) {
        int n=nums.size();
        int maxIndex = 0;
        for(int i=0; i<n; i++) {
            if(i>maxIndex || maxIndex>=(n-1)) break;//maxindex表示可以到达的最大位置，如果i>maxindex则表示到不了这个位置，自然就要跳出来输出false。
            maxIndex = max(maxIndex, i+nums[i]);
        } 
        return maxIndex>=(n-1) ? true : false;
}
/*int main(){
    vector<int> temp;
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int tmp;cin>>tmp;
        temp.push_back(tmp);
    }
    cout<<canJump(temp);
    system("pause");
    return 0;
}*/