[Programmers/JavaScript/Lv.1] 약수의 개수와 덧셈 정답

정답

function solution(left, right) {
    const evenList = [];
    const oddList = [];
    for(let i = left; i <= right; i++) {
        let divisorCount = 0;
        for(let j = 1; j <= i; j++) {
            if((i % j) === 0) {
                divisorCount++;
            }
        }
        if((divisorCount % 2) === 0) {
            evenList.push(i)
        }else{
            oddList.push(i)
        }
    }
    return evenList.reduce((a,b) => a + b) - oddList.reduce((a,b) => a + b)
}

https://school.programmers.co.kr/learn/courses/30/lessons/77884