剑指offer_数组---把数组排成最小的数

/**
 * 
 */
package 数组;
import java.util.Arrays;
import java.util.Comparator;
/**
 * <p>Title:PrintMinNumber </p>
 * <p>Description: </p>
 * @author 田茂林
 * @data 2017年8月27日 上午11:38:12
 */
public class PrintMinNumber {
  public static String printMinNumber(int [] numbers) {
    if(numbers==null||numbers.length<1){
      return null;
    }
    String[] strs = new String[numbers.length];
    for (int i = 0; i < numbers.length; i++) {
      strs[i] = String.valueOf(numbers[i]);
      //System.out.println(strs[i]);
    }
    //定义新的排序规则
    Arrays.sort(strs, new Comparator<String>() {
      @Override
      public int compare(String o1, String o2) {
        String s1 = o1+o2;
        String s2 = o2+o1;
        return s1.compareTo(s2);
      }
    });
    StringBuffer sb = new StringBuffer();
    for (int i = 0; i < strs.length; i++) {
      sb.append(strs[i]);
    }
    return sb.toString();
    }
  public static void main(String[] args) {
        int[] array = {3,32,321};
        System.out.println(printMinNumber(array));
  }
}