class Solution
{
public:
bool canJump(vector<int>& nums)
{
//cover是当前最大的下标覆盖范围
int cover = 0;
if (nums.size() == 0)
return true;
for (int i = 0; i <= cover; i++)
{
cover = max(i + nums[i], cover);
if (cover >= nums.size() - 1) return true;
}
return false;
}
};
LeetCode55. 跳跃游戏
最新推荐文章于 2024-08-14 11:22:43 发布