LeetCode-55 Jump Game

Description

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.

Constraints:
1 <= nums.length <= 3 * 10^4
0 <= nums[i][j] <= 10^5

Example

Example 1:
Input: nums = [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: nums = [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.

Submissions

给定一个非负整数数组，你最初位于数组的第一个位置，数组中的每个元素代表你在该位置可以跳跃的最大长度，判断你是否能够到达最后一个位置。经分析可知，若数组中元素都不为0，则肯定可以到达最后一个位置，因此只需要判断数组中含0的情况。若数组中第i个元素为0，则将flag先置为False，且将包含0的前i个元素取出并翻转，存为temp列表，step为距离0元素的步长，判断temp中元素与step的大小，若大于step则表示0前面的元素可以跳过0，将flag置为True。最后判断flag,若为False则结果返回False，否则返回True。

实现代码如下：

class Solution:
    def canJump(self, nums: List[int]) -> bool:
        for i in range(len(nums)-1):
            if nums[i] == 0:
                temp = nums[0:i+1][::-1]
                step = 0
                flag = False
                for item in temp:
                    if item > step: 
                        flag = True
                        break
                    step += 1
                if flag == False:
                    return False
        return True