์นดํ…Œ๊ณ ๋ฆฌ ์—†์Œ

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] ๊ธฐ๋Šฅ๊ฐœ๋ฐœ(queue์‚ฌ์šฉ,java, ๋ฏธ์™„์„ฑ)

JihyunLee 2019. 10. 3. 21:32
๋ฐ˜์‘ํ˜•

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ๊ธฐ๋Šฅ๊ฐœ๋ฐœ ๋ฌธ์ œ

queue๋ฅผ ์‚ฌ์šฉํ–ˆ๋‹ค.

์ด์ƒํ•˜๊ฒŒ 2๊ฐœ์˜ ์ผ€์ด์Šค์—์„œ ์—๋Ÿฌ๊ฐ€ ๋‚ฌ๋Š”๋ฐ ์–ด๋””์„œ ์ž˜๋ชป๋œ์ง€ ๋ชจ๋ฅด๊ฒ ๋‹คใ… ใ… 

 

 

๋‚˜์˜ ์ฝ”๋“œ

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
import java.util.*;
 
class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
                int[] answer;
        ArrayList<Integer> temp = new ArrayList<Integer>();
        int prog_num = progresses.length;
        Queue<Integer> prog_q = new LinkedList<Integer>();
        
        for(int i=0; i<prog_num; i++){
            prog_q.add(progresses[i]);
        }
        
        int index =0;
        int day =0;
        while(true){
            day += Math.ceil(100 - prog_q.poll()- day*speeds[index])/speeds[index];
            int finished =1;
            index ++;
            
            while(true){
                if(prog_q.peek()!=null && index<prog_num &&
                   prog_q.peek() + day*speeds[index] >=100){
                    finished ++;
                    index ++;
                    prog_q.poll();
                }else{
                    break;
                }
            }
            
            temp.add(finished);
            if(index == prog_num){
                break;
            }   
        }
 
        answer = new int[temp.size()];
            
        for(int i=0; i<temp.size(); i++){
            answer[i] = temp.get(i);
        }
        return answer;
    }
}
http://colorscripter.com/info#e" target="_blank" style="color:#e5e5e5text-decoration:none">Colored by Color Scripter
http://colorscripter.com/info#e" target="_blank" style="text-decoration:none;color:white">cs
๋ฐ˜์‘ํ˜•