leetcode Jump Game python答案

分析：只要元素的值爲0的那一步纔有可能無法到達頂端。但是，如果它前面的元素能夠跳過這個0，則仍然可以到達頂端。

相關算法：貪心算法（作者也在學習中）

代碼：

class Solution:
    # @param {integer[]} nums
    # @return {boolean}
    def canJump(self, nums):
        if 0 not in nums:
            return True
       
        self.num = copy.deepcopy(nums)
       
        location_0 = []
        for i in range(len(nums)-1):
            if nums[i] == 0:
                location_0.append(i)
        self.locations = copy.deepcopy(location_0)
        for location in location_0:
            self.is_arrive(location)
       
        if self.locations == []:
            return True
        else:
            return False
           
           
    def is_arrive(self, location):
        i = location-1
        while i>= 0:
            if i + self.num[i] > location:
                self.locations.remove(location)
                return
            i = i - 1