Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 23 additions & 0 deletions leetcode3/최원준/1696. Jump Game VI.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
from collections import deque

class Solution:
def maxResult(self, nums: list[int], k: int) -> int:
n = len(nums)

dp = [0] * n
dp[0] = nums[0]

dq = deque([0])

for i in range(1, n):
while dq and dq[0] < i - k:
dq.popleft()

dp[i] = nums[i] + dp[dq[0]]

while dq and dp[dq[-1]] <= dp[i]:
dq.pop()

dq.append(i)

return dp[-1]
Loading