1.题目
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.
判断一个数是否perfect number。
perfect number的定义为所有能整除这个数的因子相加刚好等于这个数。
Example:
Input: 28
Output: True
Explanation: 28 = 1 + 2 + 4 + 7 + 14
Note: The input number n will not exceed 100,000,000. (1e8)
2.分析
要找所有能整除n的除数。以28为例,可以看到,除了1以外,其余的都是成对出现:
2*14=28
4*7=28
以sqrt(28)为分界点。
3.分析
class Solution {
public:
bool checkPerfectNumber(int num) {
if(num==1)
return false;
int sum = 1;
for (int i = 2; i <= sqrt(num); i++) {
if (num%i == 0) {
sum += i;
if (i != num / i)
sum += num / i;
}
}
return sum == num;
}
};