-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.swift
42 lines (33 loc) · 1.09 KB
/
main.swift
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
//
// main.swift
// 2단계/다리를_지나는_트럭
//
// Created by Yongwoo Marco on 2022/05/12.
//
// https://programmers.co.kr/learn/courses/30/lessons/42583
import Foundation
func solution(_ bridge_length:Int, _ weight:Int, _ truck_weights:[Int]) -> Int {
var trucks = truck_weights.map{ ($0, bridge_length) }
var bridge = [(Int, Int)]()
var second = 0, currentWeight = 0
while(!trucks.isEmpty || !bridge.isEmpty) {
for (index, truck) in bridge.enumerated() {
if truck.1 == 0 {
currentWeight -= truck.0
bridge.remove(at: index)
}
}
if let first = trucks.first, currentWeight + first.0 <= weight {
currentWeight += first.0
bridge.append(trucks.removeFirst())
}
for truck in 0..<bridge.count {
bridge[truck].1 -= 1
}
second += 1
}
return second
}
print(solution(2, 10, [7,4,5,6])) // 8
print(solution(100, 100, [10])) // 101
print(solution(100, 100, [10,10,10,10,10,10,10,10,10,10])) // 110