class Solution {
public:
bool canJump(vector<int>& nums) {
int far = 0;
int index=0;
int f=0;
for (auto it = nums.begin();it<nums.end();it++)
{
index = it-nums.begin();
if (index>far) return false;
f = *it+index;
if (f>far) far = f;
if (far>=nums.size()-1) return true;
}
}
};
leetcode JumpGame
最新推荐文章于 2024-09-24 08:39:28 发布