Add solution #507

Author: JoshCrozier

0507-perfect-number.js

@@ -0,0 +1,23 @@
+/**
+ * 507. Perfect Number
+ * https://leetcode.com/problems/perfect-number/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @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;
+};

README.md

@@ -224,6 +224,7 @@
 503|[Next Greater Element II](./0503-next-greater-element-ii.js)|Medium|
 504|[Base 7](./0504-base-7.js)|Easy|
 506|[Relative Ranks](./0506-relative-ranks.js)|Easy|
+507|[Perfect Number](./0507-perfect-number.js)|Easy|
 509|[Fibonacci Number](./0509-fibonacci-number.js)|Easy|
 520|[Detect Capital](./0520-detect-capital.js)|Easy|
 541|[Reverse String II](./0541-reverse-string-ii.js)|Easy|