-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
58 lines (48 loc) · 1.48 KB
/
Solution.java
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
//
// Programmers Algorithm 8(다리를 지나는 트럭)
// https://programmers.co.kr/learn/courses/30/lessons/42583
// Created by hyungwook on 2021/07/03.
//
package com.company;
import java.util.*;
class Solution {
public int solution(int bridge_length, int weight, int[] truck_weights) {
int answer = 0;
int weight_bridge = 0;
int length = truck_weights.length;
Queue<Truck> passing = new LinkedList<>();
Queue<Truck> waiting = new LinkedList<>();
for(int i = 0; i < length; i++)
{
waiting.offer(new Truck(truck_weights[i], 0));
}
while (true) {
answer++;
if(passing.size() != 0)
{
for (Truck truck : passing)
{
truck.setTime(truck.getTime() + 1);
}
if (passing.peek().getTime() == bridge_length)
{
weight_bridge -= passing.peek().getWeight();
passing.poll();
}
}
if(passing.size() == 0 && waiting.size() == 0)
{
break;
}
if(waiting.size() != 0)
{
if(waiting.peek().getWeight() + weight_bridge <= weight)
{
weight_bridge += waiting.peek().getWeight();
passing.offer(waiting.poll());
}
}
}
return answer;
}
}