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/5502
🧭 풀이 시간
80분
👀 체감 난이도
✏️ 문제 설명
최소 개수의 문자를 삽입해서 왼->오, 오->왼이 같은 대칭 문자열 만들기
🔍 풀이 방법
LCS 알고리즘 사용
기존 문자열과 reverse 시킨 문자열을 LCS 알고리즘을 통해 최장 공통 부분 수열 구하기
이후, (전체 문자열 길이 - 최장 공통 부분 수열 길이)를 return한다.
⏳ 회고
LCS인지 생각하지도 못했다..
LCS 알고리즘 문제 더 풀어봐야겠다........