Leetcode-easy-solution/problems/507-Perfect_Number.js at main · crud0626/Leetcode-easy-solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
// 64ms, 98.19%
// 42.2 MB

const checkPerfectNumber = function(num) {
    if(num === 1) return false;

    let sum = 1;

    for(let i = 2; i <= Math.sqrt(num); i++) {
        if(num % i === 0) sum += i + num / i;
    }

    return sum === num;
};

console.log(checkPerfectNumber(28));

console.log(checkPerfectNumber(7));