题目描述
输入一个正整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。例如输入数组{3,32,321},则打印出这三个数字能排成的最小数字为321323。
package jianzhi_offer;
import java.util.Arrays;
import java.util.Comparator;
public class minValue {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] numbers = {3,32,321};
String result = printMinNumber(numbers);
System.out.println(result);
}
public static String printMinNumber(int[] numbers) {
if(numbers == null || numbers.length == 0) {
return "";
}
int len = numbers.length;
String[] str = new String[len];
StringBuffer sb = new StringBuffer();
for(int i = 0;i < len; i++) {
str[i] = String.valueOf(numbers[i]);
}
Arrays.sort(str,new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
// TODO Auto-generated method stub
String s1 = o1 + o2;
String s2 = o2 + o1;
return s1.compareTo(s2);
}
});
for(int i = 0;i < len; i++) {
sb.append(str[i]);
}
return sb.toString();
}
}