class Solution
{
public:
bool canJump(vector<int>& nums)
{
int cover = 0;
for(int i = 0; i <= cover; ++i)
{
cover = max(cover, nums[i] + i);
if(cover >= nums.size() - 1)
{
return true;
}
}
return false;
}
};
55. 跳跃游戏
最新推荐文章于 2024-07-16 22:26:22 发布