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
1 participant
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/12973
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
문자열에서 인접한 같은 문자 쌍을 만나면 제거
이 과정을 끝까지 반복했을 때 문자열이 완전히 비면 1, 아니면 0을 반환
🔍 풀이 방법
스택을 사용해 문자를 왼쪽부터 처리
스택 top과 현재 문자가 같으면 pop, 다르면 push하고, 마지막에 스택이 비었는지 확인
⏳ 회고