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官方解答:
遍历的次数不要到num,而是到一个临界点Math.sqrt(num)
public class PerfectNumber {
public static boolean checkPerfectNumber(int num) {
if(num==1)return false;
int length=0;
for(int i=2;i<Math.sqrt(num);i++)
{
if(num%i==0)
{
length+=i+num/i;
if(length>num)
{
return false;
}
}
}
length++;
return length==num;
}
public static void main(String[] args) {
System.out.println(checkPerfectNumber(28));
}
}