์นดํ
๊ณ ๋ฆฌ ์์
[ํ๋ก๊ทธ๋๋จธ์ค] ๊ธฐ๋ฅ๊ฐ๋ฐ(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
|
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){
int finished =1;
index ++;
while(true){
finished ++;
index ++;
}else{
break;
}
}
temp.add(finished);
if(index == prog_num){
break;
}
}
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 |
๋ฐ์ํ