DAY20：leetcode #55 Jump Game

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.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

Subscribe to see which companies asked this question

class Solution(object):    def canJump(self, nums):        """        :type nums: List[int]        :rtype: bool        """        if len(nums) <= 1:            return True        zero_index = []        for i in range(len(nums))[:-1]:            if nums[i] == 0:                zero_index.append(i)        for zindex in zero_index[::-1]:            flag = False            for tindex in range(0,zindex)[::-1]:                if (nums[tindex] + tindex) > zindex:                    flag = True                    break            if not flag:                return flag        return True

人品爆发图：