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
2 participants
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.
🧷 문제 링크
가르침
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
K개의 알파벳만 가르칠 수 있음가르치는 단어는
anta로 시작해tica로 끝남N개의 단어를 배울 때 모두 읽을 수 있는 단어의 최댓값🔍 풀이 방법
백트래킹..
anta랑tica는 지우고antic은 확인 제외(true처리)알파벳 26개 확인하면서 백트래킹
K - 5만큼 확인했을 때 단어들 확인해서alpha가false면 건너뛰기⏳ 회고
boolean[]대신 비트마스킹 가능하겠다