[20250226] BOJ / 플래5 / 찾기 / 신희을 #186
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/1786
🧭 풀이 시간
40 분
👀 체감 난이도
✏️ 문제 설명
입력으로 T와 P라는 문자열이 주어진다. 이때 T에서 P라는 문자열이 몇 번 출현 하는지와 출현하는 시작 위치를 출력하라.
🔍 풀이 방법
KMP 기본 문제
⏳ 회고
KMP도 슬슬 익숙해져가는 것 같다. 오랜만에 풀어봤는데, 헤매긴 했는데 풀긴 하니까 뿌듯하더라.