-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy pathLargestNumber.java
38 lines (32 loc) · 1.07 KB
/
LargestNumber.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
// https://leetcode.com/problems/largest-number
// T: O(Nlog(N))
// S: O(N)
import java.util.ArrayList;
import java.util.List;
public class LargestNumber {
private static final String ZERO = "0";
public static String largestNumber(int[] nums) {
final List<String> numbers = convertToStrings(nums);
numbers.sort((s1, s2) -> {
final String order1 = s1 + s2;
final String order2 = s2 + s1;
return order2.compareTo(order1);
});
if (numbers.get(0).equals(ZERO)) return ZERO;
return combineStrings(numbers);
}
private static String combineStrings(List<String> numbers) {
final StringBuilder result = new StringBuilder();
for (String string : numbers) {
result.append(string);
}
return result.toString();
}
private static List<String> convertToStrings(int[] array) {
final List<String> numbers = new ArrayList<>();
for (int number : array) {
numbers.add(String.valueOf(number));
}
return numbers;
}
}