g2301_2400.s2365_task_scheduler_ii.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 g2301_2400.s2365_task_scheduler_ii

// #Medium #Array #Hash_Table #Simulation #2023_07_02_Time_595_ms_(100.00%)_Space_57.7_MB_(100.00%)

@Suppress("NAME_SHADOWING")
class Solution {
    fun taskSchedulerII(tasks: IntArray, space: Int): Long {
        var space = space
        var days: Long = 0
        space++
        val lastOccurence = HashMap()
        for (i in tasks.indices) {
            if (lastOccurence.containsKey(tasks[i])) {
                val lastTimeOccurred = lastOccurence[tasks[i]]!!
                val daysDifference = days - lastTimeOccurred
                if (daysDifference < space) {
                    days += space - daysDifference
                }
            }
            lastOccurence[tasks[i]] = days
            days++
        }
        return days
    }
}