function solution(n, lost, reserve) {
for(let item of lost){
if (reserve.includes(item)){
reserve = reserve.filter((el) => el !== item);
lost = lost.filter((el => el !== item))
}
}
let cnt = n - lost.length
for (let i = 1; i <= n; i++){
if (lost.includes(i)){
if (reserve.includes(i - 1)){
lost = lost.filter((el) => el !== i)
reserve = reserve.filter((el) => el !== i - 1)
cnt++;
} else if (reserve.includes(i + 1)){
lost = lost.filter((el) => el !== i)
reserve = reserve.filter((el) => el !== i + 1)
cnt++;
}
}
}
return cnt;
}
어찌어찌 해결은 했는데 좋은 코드라고 생각은 안 들어서
다음에 그리디 알고리즘 좀 더 공부한 뒤 다시 풀어볼 예정