参考
时间复杂度: O ( n ) O(n) O(n)
空间复杂度: O ( 1 ) O(1) O(1)
class Solution {
public boolean canJump(int[] nums)
{
int maxAchieveable = 0;
for (int i = 0; i < nums.length; i++)
{
if (i > maxAchieveable)
return false;
maxAchieveable = Math.max(maxAchieveable, i + nums[i]);
}
return true;
}
}