问题描述:
Given a list of non negative integers, arrange them such that they form the largest number.
For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.
Note: The result may be very large, so you need to return a string instead of an integer.
分析:
问题的实质实际上是采用贪心算法重新进行排序;如果a+b > b+a ,则a在b前面,如此不断的选择,最后整理下字符串即可。
public String largestNumber(int[] num) {
if(num.length==0)
return "";
String[] str = new String[num.length];
for(int i=0;i<num.length;i++){
str[i]=String.valueOf(num[i]);
}
Arrays.sort(str,new Comparator<String>(){
@Override
public int compare(String o1, String o2) {
return (o1+o2).compareTo(o2+o1);
}
});
//字符串拼接到一起
System.out.println();
String result = "";
for(int i=str.length-1;i>=0;i--)
result=result.concat(str[i]);
//判断特殊情况:0开头
if(result.charAt(0)=='0')
return "0";
return result;
}