【Lintcode】379. Reorder array to construct the minimum number

题目地址：

https://www.lintcode.com/problem/reorder-array-to-construct-the-minimum-number/description

给定一个数组，允许将这些数组里的数字进行任意顺序的拼接，问能产生的最小数字是多少。参见https://blog.csdn.net/qq_46105170/article/details/105324262。思路和证明完全一样，不同的是本题是求最小数，只需排序的时候将comparator反个向即可。代码如下：

import java.util.Arrays;

public class Solution {
    /**
     * @param nums: n non-negative integer array
     * @return: A string
     */
    public String minNumber(int[] nums) {
        // write your code here
        String[] numbers = new String[nums.length];
        for (int i = 0; i < nums.length; i++) {
            numbers[i] = String.valueOf(nums[i]);
        }
    
        Arrays.sort(numbers, (n1, n2) -> (n1 + n2).compareTo(n2 + n1));
        StringBuilder sb = new StringBuilder();
        for (String number : numbers) {
            sb.append(number);
        }
        
        int i = 0;
        while (i < sb.length() && sb.charAt(i) == '0') {
            i++;
        }
        
        return i == sb.length() ? "0" : sb.substring(i);
    }
}

时间复杂度$O(n\log n)$，空间$O(n)$。