package demo01;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
/*输入一列非负整数,输出组成的最大数
* line 输入数字个数
* 例如: 输入
* 3
* 11
* 22
* 33
* 输出
* 332211
*/
public class Algorithm {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int line = sc.nextInt();
String [] strArr = new String[line];
int arr_i = 0;
while(line-- > 0) {
int num = sc.nextInt();
strArr[arr_i++] = num + "";
}
Arrays.sort(strArr,new Comparator<String>() {
public int compare(String o1, String o2) {
return (o2+o1).compareTo(o1+o2);
}
});
StringBuffer res = new StringBuffer();
for(String i : strArr) {
res.append(i);
}
System.out.println(res.toString());
sc.close();
}
}
字符数组排序算法
最新推荐文章于 2021-04-12 17:33:48 发布