leetCode刷题记录66_507_Perfect Number

/*****************************************************问题描述*************************************************
We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.
Now, given an integer n, write a function that returns true when it is a perfect number and false when it is not.
Example:
Input: 28
Output: True
Explanation: 28 = 1 + 2 + 4 + 7 + 14
判断一个数是否是完美数，完美数指的是一个数等于它的因子之和.
/*****************************************************我的解答*************************************************
/**
 * @param {number} num
 * @return {boolean}
 */
var checkPerfectNumber = function(num) {
    if(num === 1 || num === 0)
    {
        return false;
    } 
    var factor = [];
    for(var i = 1; i <= parseInt(Math.pow(num,0.5)); i++)
    {
        if(num % i === 0)
        {
            factor.push(i);
            if(num / i !== num)
            {
                factor.push(num / i);
            }                            
        }    
    }    
    var sum = 0;
    for(var index = 0; index < factor.length; index++)
    {
        sum += factor[index];
    }    
    return sum === num;
};
console.log(checkPerfectNumber(28));