题目:
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)
Subscribe to see which companies asked this question.
解题思路:
检测一个数是否为完美数,需要求出除了它自己以外的所有除数,检测的范围可以缩小至此数的平方根
代码:
public class Solution {
public boolean checkPerfectNumber(int num) {
int i=1;
int sum=1;
if(num==1){
return false;
}
for(i=2;i*i<=num;i++){
if(num%i==0){
if(sum>100000000){
return false;
}
sum= sum+i+num/i;
}
if(i*i==num){
sum = sum-i;
}
}
return sum==num;
}
}
疑问:
为什么在LeetCode上提交以下代码,提交不成功,但是自己测试是对的,只是这里没有缩小范围
public class Solution {
public boolean checkPerfectNumber(int num) {
int i=1;
int sum=0;
if(num>100000000 || num==1){
return false;
}
for(i=1;i<num;i++){
if(num%i==0){
if(sum>100000000){
return false;
}
sum= sum+i;
}
}
if(num==sum){
return true;
}
return false;
}
}