[Kotlin/프로그래머스] 코딩테스트 연습 > 스택/큐 > 다리를 지나는 트럭

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
import java.util.*

class Solution {
    fun solution(bridge_length: Int, weight: Int, truck_weights: IntArray): Int {
        var time = 0
        val queue: Queue<Int> = LinkedList()
        var i = 0
        var sum = 0

        while (true) {
            if (sum == 0 && queue.size == bridge_length && queue.all { it == 0 }) break
            time ++
            if (queue.size == bridge_length) {
                sum -= queue.poll()
            }
            val addItem = if (i < truck_weights.size) truck_weights[i] else 0
            if (queue.size < bridge_length && sum + addItem <= weight) {
                queue.offer(addItem)
                sum += addItem
                i ++
            } else {
                queue.offer(0)
            }
        }
        return time
    }
}