Skip to content

Instantly share code, notes, and snippets.

@shanecandoit
Created June 20, 2024 13:48
Show Gist options
  • Save shanecandoit/6218171bc4f6493f0d2b1934289a9b25 to your computer and use it in GitHub Desktop.
Save shanecandoit/6218171bc4f6493f0d2b1934289a9b25 to your computer and use it in GitHub Desktop.
from typing import List
class Solution:
def canJump(self, nums: List[int]) -> bool:
"""
55. Jump Game
You are given an integer array nums.
You are initially positioned at the array's first index,
and each element in the array represents your maximum jump length at that position.
Return true if you can reach the last index, or false otherwise.
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.
Constraints:
1 <= nums.length <= 104
0 <= nums[i] <= 105
"""
max_reachable = 0
for i, jump in enumerate(nums):
if i > max_reachable:
return False
max_reachable = max(max_reachable, i + jump)
if max_reachable >= len(nums) - 1:
return True
return False
assert Solution().canJump([2,3,1,1,4]) == True
assert Solution().canJump([3,2,1,0,4]) == False
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment