[20251123] BOJ / G5 / 공통 부분 문자 / 설진영 #1502
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
Implement solution for finding the longest common substring.
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/5582
🧭 풀이 시간
10분
👀 체감 난이도
✏️ 문제 설명
두 문자열의 가장 긴 공통 부분 문자열(연속) 길이 구하기
🔍 풀이 방법
dp[i][j] 는 s1의 i번째., s2의 j번째 문자에서 끝나는 공통 부분 문자열 최대 길이
그리고 문자 같으면 i-1, j-1 에서 +1 해주면됨
⏳ 회고
DP는 코드가 짧아서 좋음