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/42883
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
주어진 숫자 문자열에서 k개의 숫자를 제거해 만들 수 있는 가장 큰 수를 구하는 문제
🔍 풀이 방법
스택처럼 작동하는 문자열에 숫자를 하나씩 넣되, 새 숫자가 이전보다 크면 k가 0이 될 때까지 이전 숫자를 삭제.
모든 숫자를 처리한 뒤 k가 남으면 뒤에서 삭제하고, 남은 숫자들을 이어 붙여 최종 결과 반환
⏳ 회고
뭔가 너무 감이 안와서 힌트봄... stringbuilder를 스택처럼 쓸 수 있구나