179. Largest Number
Given a list of non negative integers, arrange them such that they form the largest number.
Example 1:
Input: [10,2]
Output: “210”
Example 2:
Input: [3,30,34,5,9]
Output: “9534330”
Note: The result may be very large, so you need to return a string instead of an integer.
solution:
定义新的排序方法来确定每个数的先后。新定义的comparator将
public String largestNumber(int[] nums) {
if (nums == null || nums.length == 0) return "";
String[] set = new String[nums.length];
for (int i = 0; i < set.length; i++) {
set[i] = String.valueOf(nums[i]);
}
Arrays.sort(set, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
// compareTo(a,b) return 1 if a > b
return (o2 + o1).compareTo(o1 + o2);
}
});
if (set[0].equals("0")) return "0";
StringBuffer res = new StringBuffer();
for (int i = 0; i < set.length; i++) {
res.append(set[i]);
}
return String.valueOf(res);
}