약수의 합

링크 : https://school.programmers.co.kr/learn/courses/30/lessons/12928

function solution(n) {
    const Arr = []
    for(let i = 1; i<n+1; i++) {
        if(n%i===0) {
            Arr.push(i)
        }
    }
  if(n===0) {
    return 0
  }
  return Arr.reduce((a,b) => a+b)
}