• Home
• com.github.javadev
• leetcode-in-kotlin
• 1.20
• source code
• Solution.kt

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1701_1800.s1705_maximum_number_of_eaten_apples.Solution.kt Maven / Gradle / Ivy

package g1701_1800.s1705_maximum_number_of_eaten_apples

// #Medium #Array #Greedy #Heap_Priority_Queue
// #2023_06_15_Time_428_ms_(100.00%)_Space_43.4_MB_(100.00%)

import java.util.PriorityQueue

class Solution {
    fun eatenApples(apples: IntArray, days: IntArray): Int {
        val minHeap = PriorityQueue { a: IntArray, b: IntArray -> a[0] - b[0] }
        var eatenApples = 0
        var i = 0
        while (i < apples.size || minHeap.isNotEmpty()) {
            if (i < apples.size) {
                minHeap.offer(intArrayOf(i + days[i], apples[i]))
            }
            while (minHeap.isNotEmpty() && (minHeap.peek()[0] <= i || minHeap.peek()[1] <= 0)) {
                minHeap.poll()
            }
            if (minHeap.isNotEmpty()) {
                eatenApples++
                minHeap.peek()[1]--
            }
            i++
        }
        return eatenApples
    }
}