贪心
Leecode 55. 跳跃游戏
class Solution {
public:
bool canJump(vector<int>& nums) {
int maxDistance = 0, size = nums.size();
if(size == 1)return true;
for(int i = 0; i < nums.size(); i++){
if(i <= maxDistance){
maxDistance = max(maxDistance, nums[i] + i);
if(maxDistance >= size - 1)return true;
}
}
return false;
}
};