완주하지 못한 선수 - #86
Open
yangyeeeun wants to merge 2 commits into
Open
Conversation
added 2 commits
July 14, 2026 08:50
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.
🍪 문제 이름
Resolve: 완주하지 못한 선
🍊 문제 정의
inputoutput[입출력 예시]
participant = ["leo", "kiki", "eden"]
completion = ["eden", "kiki"]
return = "leo"
participant = ["marina", "josipa", "nikola", "vinko", "filipa"]
completion = ["josipa", "filipa", "marina", "nikola"]
return = "vinko"
participant = ["mislav", "stanko", "mislav", "ana"]
completion = ["stanko", "ana", "mislav"]
return = "mislav"
🍑 알고리즘 설계
풀이 과정에서 본인이 생각한 내용을 작성해 주세요.
String배열 두개를 sort한 후에 앞에서부터 값이 같지않은 index가 올 때까지 for문을 돌리고 같지 않으면 해당 index의 값을 리턴하도록 함.
🥝 최악 수행 시간 복잡도
O()🍰 특이 사항 (Optional)
참고 자료나 추가로 설명하고 싶은 내용을 작성해 주세요.