JZ32 把数组排成最小的数

描述
输入一个正整数数组，把数组里所有数字拼接起来排成一个数，打印能拼接出的所有数字中最小的一个。例如输入数组{3，32，321}，则打印出这三个数字能排成的最小数字为321323。
示例1 输入： [3,32,321] 返回值： “321323”

思路1：全排列

全排列然后排序取最小

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedHashSet;

public class Solution {
    public String PrintMinNumber(int [] numbers) {
        ArrayList<String> result = new ArrayList<>();
        if (numbers == null) {
            return null;
        }
        if(numbers.length == 0){
            return "";
        }
        HashSet<String> set = new LinkedHashSet<>();
        Perm(numbers, 0, set);
        result = new ArrayList<>(set);
        Collections.sort(result);
        return result.get(0);
    }
    
    private void Perm(int[] numbers, int pos, HashSet<String> set) {
        if (pos + 1 == numbers.length) {
            set.add(concate(numbers));
            return;
        }
        for (int i = pos; i < numbers.length; i++) {
            swap(numbers, pos, i);
            Perm(numbers, pos + 1, set);
            swap(numbers, pos, i);
        }
    }
    private String concate(int[] numbers) {
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = 0; i < numbers.length; i++) {
            stringBuilder.append(numbers[i]);
        }
        return stringBuilder.toString();
    }
    private void swap(int[] numbers, int pos, int i) {
        if (pos == i) {
            return;
        }
        int tmp = numbers[pos];
        numbers[pos] = numbers[i];
        numbers[i] = tmp;
    }
}

思路2：

如果a + b < b + a, 显然我们希望a排在b的前面，因为a排在前面可以使结果更小。于是我们就自定义排序规则，使得vector中字符串都满足如上规则，那么最后的结果肯定是最小的。

import java.util.Arrays;
import java.util.stream.Collectors;

public class Solution {
    public String PrintMinNumber(int [] numbers) {
        if (numbers == null || numbers.length == 0) {
            return "";
        }
        for (int i = 0; i < numbers.length; i++) {
            for (int j = i; j < numbers.length; j++) {
                String s1 = String.valueOf(numbers[i]);
                String s2 = String.valueOf(numbers[j]);
                if ((s1 + s2).compareTo(s2 + s1) > 0) {
                    int tmp = numbers[j];
                    numbers[j] = numbers[i];
                    numbers[i] = tmp;
                }
            }
        }
        return Arrays.stream(numbers).mapToObj(String::valueOf).collect(Collectors.joining());
    }
}