Skip to content

Commit 5059a1d

Browse files
committed
[level 2] Title: 올바른 괄호, Time: 5.18 ms, Memory: 11.6 MB -BaekjoonHub
1 parent eeafdf3 commit 5059a1d

2 files changed

Lines changed: 12 additions & 9 deletions

File tree

프로그래머스/2/12909. 올바른 괄호/README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
# [level 2] 올바른 괄호 - 12909
22

3-
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/12909)
3+
[문제 링크](https://school.programmers.co.kr/learn/courses/30/lessons/12909?language=python3)
44

55
### 성능 요약
66

7-
메모리: 9.24 MB, 시간: 17.57 ms
7+
메모리: 11.6 MB, 시간: 5.18 ms
88

99
### 구분
1010

@@ -16,7 +16,7 @@
1616

1717
### 제출 일자
1818

19-
2025년 04월 16일 17:27:32
19+
2026년 07월 01일 07:38:34
2020

2121
### 문제 설명
2222

Lines changed: 9 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,11 @@
11
def solution(s):
2-
A = 0
2+
stack = []
33
for i in s:
4-
if i == "(": A += 1
5-
elif i == ")": A -= 1
6-
if A == -1: return False
7-
if A == 0: return True
8-
else: return False
4+
if stack and i == ')' and stack[-1] == '(':
5+
stack.pop()
6+
else:
7+
stack.append(i)
8+
if stack:
9+
return False
10+
else:
11+
return True

0 commit comments

Comments
 (0)