g1601_1700.s1696_jump_game_vi.Solution.kt Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.28

package g1601_1700.s1696_jump_game_vi

// #Medium #Array #Dynamic_Programming #Heap_Priority_Queue #Sliding_Window #Queue #Monotonic_Queue
// #2023_06_15_Time_497_ms_(100.00%)_Space_55.4_MB_(66.67%)

import java.util.ArrayDeque
import java.util.Deque

class Solution {
    fun maxResult(nums: IntArray, k: Int): Int {
        val deque: Deque = ArrayDeque()
        deque.offer(intArrayOf(0, nums[0]))
        for (i in 1 until nums.size) {
            val max = deque.peek()[1]
            val next = intArrayOf(i, max + nums[i])
            while (deque.isNotEmpty() && deque.peekLast()[1] <= next[1]) {
                // PURGE FROM THE END
                deque.pollLast()
            }
            deque.offer(next)
            if (deque.peekFirst()[0] <= i - k) {
                // PURGE FROM THE HEAD
                deque.pollFirst()
            }
        }
        return deque.peekLast()[1]
    }
}