삽집하는 개발들/알고리즘

[17일차][프로그래머스][42576]완주하지 못한 선수

악투 2023. 7. 4. 23:52
반응형
def solution(participant, completion):   
    participant_sort = sorted(participant)
    completion_sort = sorted(completion)
    result = ""

    for idx in range(len(participant_sort)):
        if idx < len(completion_sort):
            if participant_sort[idx] != completion_sort[idx]:                
                result = participant_sort[idx]
                break
            else:
                pass
        else:
            result = participant_sort[len(participant_sort) - 1]
            pass
        
    return result
def solution(participant, completion):   
    participant_sort = sorted(participant)
    completion_sort = sorted(completion)

    for idx in range(len(completion_sort)):  
        if participant_sort[idx] != completion_sort[idx]:                
            return participant_sort[idx]
            
    return participant_sort[len(participant_sort) - 1]
반응형