공돌이 공룡의 서재

def solution(n, lost, reserve): give = reserve.copy() for i in range(len(reserve)): if reserve[i] in lost: lost.remove(reserve[i]) give.remove(reserve[i]) check = lost.copy() reserve = give for i in range(len(reserve)): if reserve[i] - 1 in check: if len(check) != 0: check.remove(reserve[i]-1) elif reserve[i] + 1 in check: if len(check) != 0: check.remove(reserve[i]+1) else: pass return n - len(..