문제확인
https://programmers.co.kr/learn/courses/30/lessons/42862
문제풀이
function solution(n, lost, reserve) {
var answer = [];
lost.sort((a,b) => a - b)
reserve.sort((a,b) => a - b)
for(let i = 1; i <= n; i++) {
if (!lost.includes(i)) answer.push(i);
else {
if (reserve.includes(i)) {
var index = reserve.indexOf(i);
reserve.splice(index, 1);
index = lost.indexOf(i);
lost.splice(index, 1);
answer.push(i);
}
}
}
for (let i = 0; i < lost.length; i++) {
if (reserve.includes(lost[i] + 1) && reserve.includes(lost[i] - 1)) {
var index = reserve.indexOf(lost[i] - 1);
reserve.splice(index, 1);
answer.push(lost[i]);
} else if(reserve.includes(lost[i] - 1)) {
var index = reserve.indexOf(lost[i] - 1);
reserve.splice(index, 1);
answer.push(lost[i]);
}
else if(reserve.includes(lost[i] + 1)){
var index = reserve.indexOf(lost[i] + 1);
reserve.splice(index, 1);
answer.push(lost[i]);
}
}
return answer.length;
}