题目描述
输入一个正整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。例如输入数组{3,32,321},则打印出这三个数字能排成的最小数字为321323。
代码
public class Solution {
public String PrintMinNumber(int [] numbers){
String min = "";
for(int i=0;i<numbers.length;i++){
for(int j=i+1;j<numbers.length;j++){
int before = Integer.valueOf(numbers[i]+""+numbers[j]);
int after = Integer.valueOf(numbers[j]+""+numbers[i]);
// if(before>after){
// int temp = before;
// before = after;
// before = temp;
// }
//交换的值不是拼接后的两个相邻字符串
if(before>after){
int temp = numbers[i];
numbers[i] = numbers[j];
numbers[j] = temp;
}
}
}
for(int i=0;i<numbers.length;i++){
min+=String.valueOf(numbers[i]);
}
return min;
}
public static void main(String[] args){
Solution15 s = new Solution15();
int[] numbers = {3,32,321};
String min = s.PrintMinNumber(numbers);
System.out.println(min);
}
}