微软算法100题68 用数组排成最小的数

 1 package com.rui.microsoft;
 2 
 3 import java.util.Arrays;
 4 import java.util.Comparator;
 5 
 6 public class Test68_Minimum {
 7 
 8     public static void main(String[] args) {
 9         int[] a = {3,2,123};
10         Test68_Minimum app = new Test68_Minimum();
11         String res = app.smallest(a);
12         System.out.println(res);
13     }
14     
15     String smallest(int[] a){
16         Integer[] aux = new Integer[a.length];
17         for(int i = 0; i < a.length; i++){
18             aux[i] = a[i];
19         }
20         
21         Arrays.sort(aux, new Comparator<Integer>() {
22 
23             @Override
24             public int compare(Integer o1, Integer o2) {
25                 return ("" + o1 + o2).compareTo("" + o2 + o1);
26             }
27         });
28         
29         StringBuilder sb = new StringBuilder();
30         for(int i = 0; i < aux.length; i++){
31             sb.append(aux[i]);
32         }
33         return sb.toString();
34     }
35 }