力扣每日一题(二十四——完美数）

仅以此纪录每日LeetCode所刷题目

题目描述：

示例：

 代码（1）:

class Solution:
    def checkPerfectNumber(self, num: int) -> bool:
        count = 0
        list1 = [1]
        if num <= 1:
            return False
        else:
            for i in range(1,int(num**0.5)+1):
                if num % i == 0 and i not in list1 and num / i not in list1:
                    list1.append(i)
                    list1.append(num/i)
            for j in range(len(list1)):
                count += list1[j]
            if count == num:
                return True
            else:
                return False

代码（2）（别问 问就是完美数很少）：

class Solution:
    def checkPerfectNumber(self, num: int) -> bool:
        return num in {6, 28, 496, 8128, 33550336, 8589869056}