refactor 507

fishercoder1534 · fishercoder1534 · commit 91256fd8f54a · 2020-07-15T09:02:01.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_507.java b/src/main/java/com/fishercoder/solutions/_507.java
@@ -1,18 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 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
-
- Note: The input number n will not exceed 100,000,000. (1e8)
- */
 public class _507 {
 
     public static class Solution1 {
