-
-
Notifications
You must be signed in to change notification settings - Fork 195
[jungsiroo] Week 06 #888
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[jungsiroo] Week 06 #888
Conversation
from collections import deque | ||
|
||
""" | ||
BFS의 아이디어를 차용하여 풀이 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
풀이와 분석이 깔끔하고 헬퍼함수의 분리가 잘 되어 있는 것 같습니다 :)
이건 간단한 회전변환행렬을 이용한 예전 제 풀이인데, 혹시 관심 있으실까봐 남깁니다
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
와 행렬곱은 생각을 못했네요! 감사합니다~
chars = {'(':1, '{':2, '[':3, ')':-1, '}':-2, ']':-3} | ||
stack = [] | ||
|
||
for char in s: | ||
if chars[char] > 0: | ||
stack.append(char) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
이 부분이 좋네요!
value에 정수값을 두니까 조건문이 간단해져서 편해보입니다 :)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
한 주 수고하셨습니다
Solving이어서 맘 놓고 있다가 지금 들어왔는데, 벌써 좋은 리뷰가 달렸네요 ^^; |
@bus710 더 좋은 리뷰를 남겨주시면 되죠~! |
앞으로 잘 하겠습니다... ㅎㅎ |
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.