题目描述:输入一个正整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。例如输入数组{3,32,321},则打印出这三个数字能排成的最小数字为321323。
思路:
排序规则如下:
* 若ab > ba,则 a > b;
* 若ab < ba,则 a < b;
* 若ab = ba,则 a = b。
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
public class Solution {
public String PrintMinNumber(int [] numbers) {
ArrayList<Integer> list = new ArrayList<>();
String res = "";
if (numbers.length == 0) return "";
if (numbers.length == 1) return String.valueOf(numbers[0]);
for (int i = 0; i < numbers.length; i++)
list.add(numbers[i]);
Collections.sort(list, new Comparator<Integer>() {
public int compare(Integer o1, Integer o2) {
String s1 = o1 + "" + o2;
String s2 = o2 + "" + o1;
return s1.compareTo(s2);
}
});
for (Integer l : list)
res = res + l;
return res;
}
}