목록탐욕법 (1)
눈송이의 개발생활
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/qnwR8/btryp5gASkY/61Facvdk6qwMlQ6mkUhD91/img.png)
문제 https://programmers.co.kr/learn/courses/30/lessons/42862 내 코드 def solution(n, lost, reserve): s_res = set(reserve) - set(lost) s_lost = set(lost) - set(reserve) for i in s_res: if i - 1 in s_lost: s_lost.remove(i - 1) elif i + 1 in s_lost: s_lost.remove(i + 1) return n - len(s_lost) 다른 사람 풀이 def solution(n, lost, reserve): _reserve = [r for r in reserve if r not in lost] _lost = [l for l in l..