10/26 체육복(나중에 다시 풀어볼것)

https://school.programmers.co.kr/learn/courses/30/lessons/42862

.

풀긴 풀었는데 찝찝하다

나중에 다시 풀어봐야 할 문제이다.

내풀이

def solution(n, losts, reserves):
    losts.sort()
    reserves.sort()
    
    for lost in losts[:] :
        if lost in reserves :
            reserves.remove(lost)
            losts.remove(lost)
            
    for reserve in reserves :
        if reserve - 1 in losts :
            losts.remove(reserve - 1)
        
        elif reserve + 1 in losts :
            losts.remove(reserve + 1)
    
    answer = n - len(losts)
    return answer