[LeetCode] 507. Perfect Number

最新推荐文章于 2024-04-24 11:37:01 发布

转载最新推荐文章于 2024-04-24 11:37:01 发布 · 48 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://segmentfault.com/a/1190000016477680

本文介绍了一个用于检查完美数的算法实现。完美数是指一个正整数等于其所有除自身外的正因数之和。文章提供了Java代码示例，通过遍历到数的平方根来高效地判断一个数是否为完美数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

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)

Solution

class Solution {
    public boolean checkPerfectNumber(int num) {
        if (num == 1) return false;
        int sum = 1;
        for (int i = 2; i <= Math.sqrt(num); i++) {
            int remainder = num % i;
            if (remainder == 0) {
                sum += i + num/i;
            }
        }
        System.out.println(sum);
        return sum == num;
    }
}