您的位置 首页 JAVA(2017)

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)

 

class Solution {
    public boolean checkPerfectNumber(int num) {
        if(num == 1) return false;
        int sum = 0;
        for(int i=2; i<=Math.sqrt(num);i++){
            if(num%i == 0){
                sum += i;
                if(num/i != i) sum += num/i;
            }
        }
        return sum+1 == num;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《507. Perfect Number》

发表评论

电子邮件地址不会被公开。

返回顶部