function solution1(arr, divisor) {
const answer = [];
for (const num of arr) {
if (num % divisor === 0) {
answer.push(num);
}
}
if (!answer.length) return [-1];
return answer.sort((a, b) => a - b);
}
reduce๋ฅผ ์ด์ฉํ ํ์ด
function solution2(arr, divisor) {
const answer = arr
.reduce((acc, cur) => {
if (cur % divisor === 0) acc.push(cur);
return acc;
}, [])
.sort((a, b) => a - b);
if (!answer.length) return [-1];
return answer;
}