moonlightshadow123
6/25/2017 - 10:29 AM

55. Jump Game

  1. Jump Game
solution.py
content_copyfile_download
class Solution(object):
    def canJump(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        n = len(nums)
        maxIdxSoFar = 0
        curIdx = 0
        while curIdx <= maxIdxSoFar:
            maxIdxSoFar = max(curIdx + nums[curIdx], maxIdxSoFar)
            if maxIdxSoFar >= n-1:
                return True
            curIdx += 1
        return False
55-Jump-Game.md
content_copyfile_download
  • Rendered
  • Source

https://leetcode.com/problems/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.

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

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