题目:
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
Example 1:
Input: [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:
Input: [3,2,1,0,4] Output: false Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
思路:这道题的题意是让我们判断在一个数组中该数组是否满足以下条件:该数组(所有数字从第一个数开始,最大可以跳转这个当前指针所指向的值代表的步数,且可以跳转到最后一个数字。如果我们按照题意从头开始遍历,并且考虑到每一个可能的步数,这样的复杂度非常大。因此我们考虑当数组不满足条件的情况,也就是出现步数为0的情况,并且无法跳过这个位置,也就是在0之前的指针所指向的数字都小于指针和位置0之间的距离,因此我们在遇到每一个0的时候都考虑前面的数字与0的距离,复杂度为O(n^2)
答案:
class Solution:
def canJump(self, nums):
now=0
while now<len(nums)-1:
if nums[now]==0:
item=0
flag=False
while item<now:
if now-item<nums[item]:
flag=True
break
item=item+1
if flag==False:
return False
now=now+1
return True