[20250715] BOJ / G4 / 문자열 폭발 / 이준희 #467
Merged
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://www.acmicpc.net/problem/9935
🧭 풀이 시간
120분+
👀 체감 난이도
✏️ 문제 설명
문자열과 폭발문자열이 주어졌을 때
문자열이 폭발문자열을 포함하고 있으면 폭발문자열을 삭제하고 나머지를 이어붙입니다.
더이상 폭발하는 문자열이 없을때까지 반복한 후 결과를 출력하는 문제입니다.
🔍 풀이 방법
처음에는 String.replace를 활용하여 풀었으나 메모리가 초과하여 해결방법에 대해 고민했습니다.
해결방법이 떠오르지 않아 힌트를 받아 풀었습니다.
⏳ 회고
string 이라는 것에 매몰되어 버리면 풀수 없는 문제였던 것 같습니다.
체감 난이도가 실제 난이도보다 훨씬 높았던 것 같습니다.