We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent e34b5b6 commit 70a1245Copy full SHA for 70a1245
1 file changed
live8/test87/문제1/백유진.py
@@ -1,12 +1,13 @@
1
def solution(numbers):
2
- answer = []
+ n = len(numbers)
3
+ answer = [-1] * n
4
+ stack = []
5
+
6
+ for i in range(n):
7
+ while stack and numbers[stack[-1]] < numbers[i]:
8
+ index = stack.pop()
9
+ answer[index] = numbers[i]
10
11
+ stack.append(i)
12
- for i in range(len(numbers)):
- for j in range(i+1, len(numbers)):
- if numbers[j] > numbers[i]:
- answer.append(numbers[j])
- break
- if len(answer) != i+1:
- answer.append(-1)
-
13
return answer
0 commit comments