[Leetcode从零开刷]760. Find Anagram Mappings

题目来源：
leetcode:
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

题目意思很容易理解，判定一个数是否是最好数。即它的分解数求和是原数。
第一次自己买看例子之前写的代码：
尼玛超时了！以此纪念：

class Solution {
    public boolean checkPerfectNumber(int num) {
        int sum=0;
        List<Integer> res = new ArrayList<Integer>();
        for(int i = 1;i<=num/2;i++){ 
            if(num%i == 0) res.add(i);
        }

        for(int d:res){
            sum +=d;
        }     
        if(sum == num) return true;
        else
            return false;
    }
}