[20250713] BOJ / G1 / 팰린드롬 분할 / 이강현 #453
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
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/1509
🧭 풀이 시간
90분
👀 체감 난이도
✏️ 문제 설명
문자열이 주어질 때, 팰린드롬으로 분할하는 최소 개수를 출력
🔍 풀이 방법
dp
⏳ 회고
특정 구간이 팰린드롬인지를 구분하는 것은 dp를 사용해서 쉽게 해결했지만,
최소 개수로 분할하는 부분 또한 dp를 통해 해결한다는 점을 놓쳐서 오래걸렸다.