Open
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.
문제 상황
현재 레포지토리의 예제 코드가 프로그래머스 효율성 테스트 4번 케이스를 시간 초과로 통과하지 못합니다.
수정 사항
기존에 모든 전화번호에 대해 prefix를 만들어 HashSet에 저장한 뒤
전화번호들을 반복하며 해당 HashSet에 전화번호와 일치하는 String이 존재하는지 확인하는 방식이 아닌
전화번호들을 HashSet에 모두 저장한 뒤에
전화본들을 반복하며 prefix를 만들어 해당 prefix와 일치하는 String이 존재하는지 확인하는 방식으로 변경하였습니다.