1199. Perfect Number

描述

We define the Perfect Number is a positive integer that is equal to the sum of all its positivedivisors 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.

The input number n will not exceed 100,000,000

您在真实的面试中是否遇到过这个题？   是

样例

Example:

Input: 28
Output: True
Explanation: 28 = 1 + 2 + 4 + 7 + 14

无难度题目，逐个遍历相加即可。

class Solution {
public:
    /**
     * @param num: an integer
     * @return: returns true when it is a perfect number and false when it is not
     */
    bool checkPerfectNumber(int num) {
        // write your code here
        int sum=0;
        for(int i=1;i<sqrt(num);i++){
            if(i==1)
                sum+=i;
            else if(num%i==0&&i!=num%i)
                sum+=i+num/i;
            else if(num%i==0&&i==num%i)
                sum+=i;
        }
        if(sum==num) return true;
        else return false;
    }
};