Search

๊ฐ๋„ํ˜„

2.๋ฌธ์ œ์ด๋ฆ„
3. ์ˆ˜ํ–‰์‹œ๊ฐ„[์ดˆ(s)]
1200
์ข‹์•„์š” ๋ˆ„๋ฅด๊ธฐ
์ข‹์•„์š” ์ˆ˜
: 0
5 more properties
| ์ฝ”๋“œ ์ž‘์„ฑํ•˜๊ธฐ
import java.util.Arrays; public class Programmers_queue { public static int[] solution(int[] prices) { int[] answer = new int[prices.length]; int cnt = 0; for (int i = 0; i < prices.length; i++) { cnt = 0; for (int j = i + 1; j < prices.length; j++) { cnt = j - i; if (prices[i] > prices[j]) break; } answer[i] = cnt; } return answer; } public static void main(String[] args) { System.out.println(Arrays.toString(solution(new int[]{1, 2, 3, 2, 3}))); } }
Java
๋ณต์‚ฌ
| ์ฝ”๋“œ ์„ค๋ช…ํ•˜๊ธฐ