问题描述:
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.
分析:这道题表面看规律很简单,就是从最高位开始比较,选择较大一位,相同的,比较第二位,对于位数不足的,就把最高位作为延伸进行比较。这种找规律的方法非常非常繁琐,就是比较两个数的大小,都非常不好处理。
一个比较好的办法,就是干脆两个数进行连接,然后拼接后两个数的大小。
代码如下:376ms
public String largestNumber(int[] nums) {
int length = nums.length;
List<Integer> list = new ArrayList<>();
for(int i = 0;i<length;i++)
list.add(nums[i]);
StringBuilder builder = new StringBuilder();
//排序
Collections.sort(list, new Comparator<Integer>() {
@Override
public int compare(Integer val1, Integer val2) {
int tmpVal1 = val1,tmpVal2 = val2;
int tmp1 = val1,tmp2 = val2;
while(true)
{
tmp2/=10;
tmpVal1=tmpVal1*10;
if(tmp2==0)
break;
}
tmpVal1+=val2;
while(true){
tmpVal2 = tmpVal2*10;
tmp1/=10;
if(tmp1==0)
break;
}
tmpVal2+=val1;
return tmpVal1-tmpVal2;
}
});
if((int)list.get(length-1)==0)
return "0";
for(int i = length-1;i>=0;i--){
builder.append(list.get(i));
}
return builder.toString();
}