Jump Game VI LeetCode solution in Python

1
class Solution:
2
    def maxResult(self, nums, k):
3
        deq, n = deque([0]), len(nums)
4

5
        for i in range(1, n):
6
            while deq and deq[0] < i - k:
7
                deq.popleft()
8
            nums[i] += nums[deq[0]]
9
            while deq and nums[i] >= nums[deq[-1]]:
10
                deq.pop()
11
            deq.append(i)
12

13
        return nums[-1]