[Python][Greedy] 체육복

프로그래머스 

Greedy 문제: 체육복

 

프로그래머스

 

 

 

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