문제 링크 https://programmers.co.kr/learn/courses/30/lessons/42862#
그리디 알고리즘 Level 1 문제
def solution(n, lost, reserve):
for k in reserve:
if k in lost:
reserve.remove(k)
lost.remove(k)
answer = n - len(lost)
for i in lost:
if i in reserve:
answer += 1
reserve.remove(i)
elif i-1 in reserve:
answer += 1
reserve.remove(i-1)
elif i+1 in reserve:
answer += 1
reserve.remove(i+1)
return answer