public static boolean isPerfectNumber(int num) { int originalNum = num; int lastNum = num; int index = 2; int newSum = 1; while (index < lastNum) { if(num % index == 0) { lastNum = num / index; newSum += index; newSum += lastNum; } index++; } return newSum == originalNum; } 这种方式判断不也还好吗