JAVA_Perfect Number_LeetCode 507

JAVA_Perfect Number_LeetCode 507 풀이 class Solution { public boolean checkPerfectNumber(int num) { if(num == 1) return false; int sum = 1; for(int i=2; i<=Math.sqrt(num); i++){ if(num%i == 0) sum+=i + num/i; } return sum == num; } } * 출처 Perfect Number - LeetCode Perfect Number - A perfect number [https://en.wikipedia.org/wiki/Perfect_number] is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. A divisor of an integer x is an integer that can divid...

원문링크 : JAVA_Perfect Number_LeetCode 507