[LeetCode C++实现]55.跳跃游戏
class Solution {
public:
bool canJump(vector<int>& nums) {
int size = nums.size();
int right = 0;
for(int i = 0;i < size;i++)
{
if(i <= right)
{
right = max(right,i + nums[i]);
if(right >= size - 1)
return true;
}else
return false;
}
return false;
}
};
这道题的思路是贪心,从前往后计算能够到达的最远距......