I. Description
II. Code
class Solution:
def buildArray(self, target: List[int], n: int) -> List[str]:
# 초기화
output_list = []
checked = 1
for i in range(1, n+1):
if i in target:
while checked != i:
output_list.append("Push")
output_list.append("Pop")
checked += 1
output_list.append("Push")
checked += 1
return output_list
과정이 간단하게 이루어진다.
'🧑💻 Coding Test > Stack Queue' 카테고리의 다른 글
[Programmers] 같은 숫자는 싫어 (0) | 2025.07.02 |
---|---|
[LeetCode] 1008. Construct Binary Search Tree from Preorder Traversal (0) | 2025.01.26 |
[LeetCode] 1006. Clumsy Factorial (0) | 2025.01.26 |
[LeetCode] 1003. Check If Word Is Valid After Substitutions (0) | 2025.01.26 |
[LeetCode] 2487. Remove Nodes From Linked List (0) | 2025.01.24 |