|
LeetCode地址：https://leetcode-cn.com/problems/largest-number/
public compare(list:Array<number>):string {
let length:number = list.length;
for(let i:number=0; i<length; i++) {
for(let j:number=(i+1); j<length; j++) {
if(parseInt(list[i].toString() + list[j].toString()) < parseInt(list[j].toString() + list[i].toString())) {
let tmp:number = list[i];
list[i] = list[j];
list[j] = tmp;
}
}
}
let str:string = "";
for(let i:number=0; i<length; i++) {
str += list[i].toString();
}
return str;
} | 
转播
