Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://school.programmers.co.kr/learn/courses/30/lessons/76502
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
소괄호,중괄호,대괄호로 이루어진 문자열이 있음.
괄호가 올바르게 잘 열리고 닫힌 경우에 옳은 문자열이라고 함.
괄호를 한칸씩 왼쪽으로 회전할때, 옳은 문자열의 전체 개수를 구하기.
🔍 풀이 방법
스택
그냥 한칸씩 회전하면서 스택 이용해서 괄호 쌍이 잘 맞는지 체크하면 댐.
⏳ 회고
뭔가 O(N)으로 한번에 옳은 문자열을 탐색할 수 있지 않을까하는 생각으로 접근하다가 오래걸림.
그냥 더럽게 짜버림 ㅎ