class Solution
{
public:
int jump(vector<int>& nums)
{
int curMaxCoverIndex = 0;
int nextMaxCoverIndex = 0;
int count = 0;
for (int i = 0; i < nums.size(); i++)
{
nextMaxCoverIndex = max(i + nums[i], nextMaxCoverIndex);
if (i == curMaxCoverIndex && i < nums.size() - 1)
{
count++;
curMaxCoverIndex = nextMaxCoverIndex;
if (curMaxCoverIndex >= nums.size() - 1)
break;
}
}
return count;
}
};
LeetCode45.跳跃游戏 II
于 2024-06-24 10:12:48 首次发布