https://programmers.co.kr/learn/courses/30/lessons/42584
import java.util.*;
class Solution {
public int[] solution(int[] prices) {
int[] answer = new int[prices.length];
Deque<Integer> deque = new ArrayDeque<>();
for (int price : prices) {
deque.add(price);
}
int idx = 0;
while (deque.size() > 0) {
int price = deque.removeFirst();
int count = 0;
for (Integer now : deque){
count++;
if (price > now) {
break;
}
}
answer[idx++] = count;
}
return answer;
}
}
Deque
에 넣어 하나씩 뺀다음 나머지를 for문을 돌려 뺀 원소보다 나머지에서 더 작은게 나오면 break해 count
값을 넣어줘 리턴