[20260311] BOJ / G5 / 회문 / 이준희#2013
Merged
ShinHeeEul merged 1 commit intomainfrom Mar 11, 2026
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/17609
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
앞뒤가 똑같은 문자열을 팰린드롬 문자열이라고 하고, 한글자를 삭제했을 때 팰린드롬이 되면 유사 팰린드롬 문자열이라고 합니다.
주어진 문자열이 팰린드롬이면 0, 유사 팰린드롬이면 1, 이도저도 아니면 2를 출력하는 문제입니다.
🔍 풀이 방법
투포인터를 써서 양쪽 끝에서부터 한글자씩 비교했습니다.
유사 팰린드롬을 찾아야되는 경우에는 왼쪽에서 스킵, 오른쪽에서 스킵하는 경우로 분기하여 찾았습니다.
스킵을 2번 이상 한 경우에는 계속 2를 리턴하였습니다.
⏳ 회고
투포인터 쉬운 문제였습니다.