g0601_0700.s0636_exclusive_time_of_functions.Solution.kt Maven / Gradle / Ivy

Go to download

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.30

package g0601_0700.s0636_exclusive_time_of_functions

// #Medium #Array #Stack #2023_02_10_Time_270_ms_(80.00%)_Space_37.3_MB_(20.00%)

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

class Solution {
    fun exclusiveTime(n: Int, logs: List): IntArray {
        val stack: Deque = ArrayDeque()
        val result = IntArray(n)
        for (content in logs) {
            val log = Log(content)
            if (log.isStart) {
                stack.push(log)
            } else {
                val top = stack.pop()
                val executionTime = log.time - top.time + 1
                result[top.id] += executionTime - top.waitingTime
                if (stack.isNotEmpty()) {
                    stack.peek().waitingTime += executionTime
                }
            }
        }
        return result
    }

    private class Log internal constructor(content: String) {
        var id: Int
        var isStart: Boolean
        var time: Int
        var waitingTime: Int
        init {
            val tokens = content.split(":".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
            id = tokens[0].toInt()
            isStart = tokens[1] == "start"
            time = tokens[2].toInt()
            waitingTime = 0
        }
    }
}