#507 - Perfect Number

Easy • View on LeetCode • View on GitHub

Problem Description

A perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. A divisor of an integer x is an integer that can divide x evenly.

Given an integer n, return true if n is a perfect number, otherwise return false.

Solution

/**
 * @param {number} num
 * @return {boolean}
 */
var checkPerfectNumber = function(num) {
  let result = 0;
  for (let i = 1; i <= num / 2; i++) {
    if (num % i === 0) result += i;
  }
  return result === num;
};