-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFormLargestNumber.java
74 lines (58 loc) · 2.07 KB
/
FormLargestNumber.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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
import java.util.ArrayList;
import java.util.List;
/**
* Write a function that given a list of non negative integers, arranges them such that they form the largest possible number.
* For example, given [50, 2, 1, 9], the largest formed number is 95021.
*/
public class FormLargestNumber {
public static void main(String[] args) {
List<Integer> list = new ArrayList<>();
list.add(50);
list.add(2);
list.add(1);
list.add(9);
List<Integer> orderedList = new ArrayList<>();
while(!list.isEmpty()){
int index = getIndexOfLargestNumber(list);
orderedList.add(list.remove(index));
}
orderedList.forEach(number -> {
System.out.print(number);
});
}
private static int getIndexOfLargestNumber(List<Integer> list) {
int index = 0;
Integer candidate = null;
for (int i=0; i<list.size(); i++){
if(candidate == null || isLarger(list.get(i), candidate)){
candidate = list.get(i);
index = i;
}
}
return index;
}
private static boolean isLarger(int isLargerCandidate, int comparedTo) {
boolean isLarger = false;
List<Integer> isLargerCandidateDigits = getDigits(isLargerCandidate);
List<Integer> comparedToDigits = getDigits(comparedTo);
int numberOfIterations = (comparedToDigits.size() > isLargerCandidateDigits.size())
? isLargerCandidateDigits.size()
: comparedToDigits.size();
for(int i=0; i < numberOfIterations; i++){
if(isLargerCandidateDigits.get(i) > comparedToDigits.get(i)) {
isLarger = true;
}
}
return isLarger;
}
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;
}
}