[leetCode] 507. Perfect Number (Python)

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)

 

Solution

import math 

class Solution(object):
    def checkPerfectNumber(self, num):
        
        if num <= 1: 
            return False
        my_sum = 1
        for i in range(2, int(math.sqrt(num) + 1)):
            if num % i == 0:
                my_sum = my_sum + i + num / i
        return num == my_sum

 

SOMJANG/CODINGTEST_PRACTICE