题解 | #把数组排成最小的数#

import java.util.ArrayList;

public class Solution { public String PrintMinNumber(int [] numbers) { if(numbers.length == 0) return "";

	String[] s_arr = new String[numbers.length];
	for(int i = 0;i < numbers.length;i++) s_arr[i] = "" + numbers[i];
	
	String s = "";
	for(int i = 0;i < s_arr.length;i++) {
		for(int j = i+1;j < s_arr.length;j++) {
			if(is_big(s_arr[i],s_arr[j])) {
				String temp = s_arr[i];
				s_arr[i] = s_arr[j];
				s_arr[j] = temp;
			}
		}
	}
	for(int i = 0;i < s_arr.length;i++) s += s_arr[i];
	
	return s;
}

private boolean is_big(String s1,String s2) {
	String str1 = s1 + s2;
	String str2 = s2 + s1;
	boolean flag = false;
	for(int i = 0;i < str1.length();i++) {
		if(str1.charAt(i) == str2.charAt(i)) {
			continue;
		}
		flag = str1.charAt(i)<str2.charAt(i) ? false:true;
		break;
	}
	
	return flag;
}

}