[LeetCode] 55. Jump Game

- Problem

55. Jump Game

- 내 풀이

class Solution:
    def canJump(self, nums: List[int]) -> bool:
        max_position, last_position = 0, len(nums) - 1

        for i, v in enumerate(nums):
            if i > max_position:
                return False
            
            if max_position >= last_position:
                return True
            
            max_position = max(max_position, i+v)

        return True

- 결과

DP 싫어요