输入一个正整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。例如输入数组{3,32,321},则打印出这三个数字能排成的最小数字为321323。
package offer.PrintMinNumber;
import java.util.Arrays;
import java.util.Comparator;
public class Solution {
public String PrintMinNumber(int [] numbers) {
int len=numbers.length;
String[] array=new String[len];
for(int i=0;i<len;i++){
String s=String.valueOf(numbers[i]);
array[i]=s;
}
Arrays.sort(array, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
return (o1+o2).compareTo(o2+o1);
}
});
String rs="";
for(int i=0;i<len;i++){
rs+=array[i];
}
return rs;
}
public static void main(String[] args) {
Solution solution=new Solution();
int[] numbers={3,32,321};
String rs= solution.PrintMinNumber(numbers);
System.out.println(rs);
}
}