We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents d0d1881 + 55b9ef1 commit 360f283Copy full SHA for 360f283
LiiNi-coder/202511/12 PGM 뒤에 있는 큰 수.md
@@ -0,0 +1,30 @@
1
+```java
2
+import java.util.*;
3
+
4
+class Solution {
5
+ public int[] solution(int[] numbers) {
6
+ int n = numbers.length;
7
+ int[] answer = new int[n];
8
9
+ Arrays.fill(answer, -1);
10
11
+ Deque<Integer> stack = new ArrayDeque<Integer>();
12
13
+ for(int i = 0; i< n; i++){
14
+ while(!stack.isEmpty()){
15
+ if(numbers[stack.peek()] < numbers[i]){
16
+ int index = stack.pop();
17
+ answer[index] = numbers[i];
18
+ }else{
19
+ break;
20
+ }
21
22
+ //
23
+ stack.push(i);
24
25
26
+ return answer;
27
28
+}
29
30
+```
0 commit comments