1
class Solution {
2
public boolean checkPerfectNumber(int num) {
3
if (num == 1) return false;
4

5
int sum = 1;
6
for (int i = 2; i < Math.sqrt(num); i++) {
7
if (num % i == 0) {
8
sum += i + num / i;
9
}
10
}
11
if (sum == num) {
12
return true;
13
} else {
14
return false;
15
}
16
}
17
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0