class Solution {
public:
bool canJump(vector<int>& nums) {
int i = 0,n = nums.size() -1;
for(int reach = 0;i<=n && i<=reach;i++)
reach = max(i+nums[i],reach);
return i == n+1;
}
};
贪心算法, just brilliant
每一步都求能达到的最大的范围。