-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPerfectNumber.java
46 lines (35 loc) · 1.19 KB
/
PerfectNumber.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/**
* A number is considered perfect if its digits sum up to exactly 10.
*
* Given a positive integer n, return the n-th perfect number.
*
* For example, given 1, you should return 19. Given 2, you should return 28.
*/
import java.util.ArrayList;
import java.util.List;
public class PerfectNumber {
public static void main(String[] args){
Integer number = 25301;
Integer perfectNumber = calculatePerfectNumber(number);
System.out.println("Perfect number is : " + perfectNumber);
}
private static Integer calculatePerfectNumber(Integer number) {
List<Integer> digits = getDigits(number);
int sum = digits.stream().mapToInt(Integer::intValue).sum();
if(10 - sum < 0){
System.out.println("no perfect number found");
return null;
}
return (number * 10) + (10 - sum);
}
private static List<Integer> getDigits(int number) {
List<Integer> digits = new ArrayList<>();
while(number >= 1){
int quotient = number / 10;
int remainder = number % 10;
digits.add(0, remainder);
number = number / 10;
}
return digits;
}
}