[Programmers] - 체육복 (Level 1)

---

탐욕법(Greedy)
LEVEL : 1

문제 링크

n = 5
lost = [4,2]
reserve = [3,5,1]

def solution(n, lost, reserve):

    new_lost = set(lost) - set(reserve)
    new_reserve = set(reserve) - set(lost)

    for l in new_lost:
        if l-1 in new_reserve:
            new_reserve.remove(l-1)
        elif l+1 in new_reserve:
            new_reserve.remove(l+1)
        else:
            n-=1

    return n

solution(n, lost, reserve)

5