把数组排成最小的数_32

public String PrintMinNumber(int [] numbers) {
        if (numbers==null||numbers.length<1){
            return "";
        }

        for (int i = 0; i < numbers.length; i++) {
            for (int j = i+1; j < numbers.length; j++) {
                int ij=Integer.parseInt(numbers[i]+""+numbers[j]);
                int ji=Integer.parseInt(numbers[j]+""+numbers[i]);
                if (ij>ji){
                    int temp=numbers[i];
                    numbers[i]=numbers[j];
                    numbers[j]=temp;
                }
            }
        }

        StringBuilder sb=new StringBuilder();
        for (int number : numbers) {
            sb.append(number);
        }
        return sb.toString();
    }

public String PrintMinNumber(int [] numbers) {
        //输入一个正整数数组，把数组里所有数字拼接起来排成一个数，打印能拼接出的所有数字中最小的一个。
        // 例如输入数组{3，32，321}，则打印出这三个数字能排成的最小数字为321323.
        String[] strings=new String[numbers.length];
        for(int i=0;i<numbers.length;i++){
            strings[i]= String.valueOf(numbers[i]);
        }
        Arrays.sort(strings, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                return (o1+o2).compareTo(o2+o1);
            }
        });
        String res="";
        for (String s: strings
             ) {
            res+=s;
        }
        return res;
    }