코테/프로그래머스

다리를 지나가는 트럭

밍래그로프 2021. 1. 6. 14:38
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
import java.util.*;
 
class Solution {
    public int solution(int bridge_length, int weight, int[] truck_weights) {
        int answer = 0; //시간초
        int inBridge = 0; //현재 다리의 상황
        Queue<Integer> q = new LinkedList();
        for(int i : truck_weights){
            while(true){
                if(q.isEmpty()){
                    q.offer(i);
                    inBridge += i;
                    answer++;
                    break;
                }else if(q.size() == bridge_length){
                    inBridge -= q.poll();
                }else{
                    if(inBridge + i > bridge_length){
                        q.offer(0);
                        answer++;
                    }else{
                        q.offer(i);
                        inBridge += i;
                        answer++;
                        break;
                    }
                }                 
            }
        }
        return answer + bridge_length ; //걸린 시간 + 다리의 길이 
    } 
}
 cs

참고를 하면서 본 풀이 근데 안된다.