Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0501_0600.s0507_perfect_number.Solution

```
public class Solution
extends Object
```
507 - Perfect Number.
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.

Example 1:

Input: num = 28

Output: true

Explanation: 28 = 1 + 2 + 4 + 7 + 14 1, 2, 4, 7, and 14 are all divisors of 28.

Example 2:

Input: num = 7

Output: false

Constraints:
- 1 <= num <= 10⁸

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean checkPerfectNumber(int num)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

checkPerfectNumber

public boolean checkPerfectNumber(int num)