blob: 0458b91aa25f82cd94f93a4db3b74c909d8d2f79 (
plain)
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
|
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class LargestNumber {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
String[] a = new String[n];
for (int i = 0; i < n; i++) {
a[i] = scanner.next();
}
System.out.println(getLargestNumber(a));
}
public static String getLargestNumber(String[] numbers) {
List<String> numList = new ArrayList<String>(Arrays.asList(numbers));
String result = "";
String maxDigit = "0";
int indexHolder = 0;
while (numList.size() > 0) {
for (int i = 0; i < numList.size(); i++) {
if (compareLeadingDigit(numList.get(i), maxDigit)) {
maxDigit = numList.get(i);
indexHolder = i;
}
}
result = result + maxDigit;
maxDigit = "0";
numList.remove(indexHolder);
}
return result;
}
public static boolean compareLeadingDigit(String string, String maxDigit) {
if (string.length() == maxDigit.length())
return Integer.parseInt(string) > Integer.parseInt(maxDigit);
if (string.length() < maxDigit.length()) {
if (string.charAt(0) > maxDigit.charAt(0)) {
return true;
} else if (string.charAt(0) < maxDigit.charAt(0)) {
return false;
} else if (string.charAt(0) > maxDigit.charAt(1)) {
return true;
} else if (string.charAt(0) < maxDigit.charAt(1)) {
return false;
} else if (maxDigit.length() == 2)
return false;
else {
return string.charAt(0) > maxDigit.charAt(2);
}
} else {
return !compareLeadingDigit(maxDigit, string);
}
}
}
|
