import java.util.ArrayList;
public class Solution {
public String PrintMinNumber(int [] numbers) {
//从左到右,两两比较,小的在前面
String ans="";
if(numbers.length==0)
{
return "";
}
if(numbers.length==1)
{
return Integer.toString(numbers[0]);
}
//冒泡方法比较,每次找到一个
for(int i=0;i<numbers.length-1;i++)
{
for(int j=0;j<numbers.length-1-i;j++)
{
String a=Integer.toString(numbers[j])+Integer.toString(numbers[j+1]);
String b=Integer.toString(numbers[j+1])+Integer.toString(numbers[j]);
if(Double.parseDouble(a)>Double.parseDouble(b))
{
int cen=numbers[j+1];
numbers[j+1]=numbers[j];
numbers[j]=cen;
}
}
}
//最后进行拼接
for(int j=0;j<numbers.length;j++)
{
ans=ans+Integer.toString(numbers[j]);
}
return ans;
}
}