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.
🧷 문제 링크
오아시스 재결합
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
스택
🔍 풀이 방법
(val, cnt)를 저장하는 스택 생성push할 때peek().val이 넣으려는 값과 같거나 작으면pop()부터 해줘야함pop().cnt는ans에 저장 필요예제 보면 같은 값끼리는 확인 가능하므로
peek().val == input이면peek().cnt값을 현재의cnt에 더해줌반복이 끝나고 스택에 값이 남아있으면 큰 수기 때문에 확인 가능하므로
ans++⏳ 회고
까다롭긴 했는데 플레치고는 쉬운 듯