[프로그래머스 lv1] 체육복 - 파이썬(Python)

문제

프로그래머스

첫 번째 풀이

def solution(n, lost, reserve):
    lost.sort()
    res = n - len(lost)
    del_lost = []
    for l in lost:
        if l in reserve:
            res += 1
            reserve.remove(l)
            del_lost.append(l)
    lost = list(set(lost) - set(del_lost)) 
    for l in lost:
        if l-1 in reserve:
            res += 1
            reserve.remove(l-1)
        elif l+1 in reserve:
            res += 1
            reserve.remove(l+1)
    return res

두 번째 풀이

def solution(n, lost, reserve):
    only_lost = set(lost) - set(reserve)
    only_reserve = set(reserve) - set(lost)
    find = 0
    for l in only_lost:
        if l-1 in only_reserve:
            find += 1
            only_reserve.remove(l-1)
        elif l+1 in only_reserve:
            find += 1
            only_reserve.remove(l+1)
    return n - len(only_lost) + find

다른 사람 풀이

def solution(n, lost, reserve): 
    only_reserve = set(reserve) - set(lost) 
    only_lost = set(lost) - set(reserve) 
    for i in only_reserve: 
        if i-1 in only_lost: 
            only_lost.remove(i-1)    
        elif i+1 in only_lost: 
            only_lost.remove(i+1)  
    return n - len(only_lost)