☆打卡算法☆LeetCode 179. 最大数 算法解析

示例 1：
输入： nums = [10,2]
输出： "210"

示例 2：
输入： nums = [3,30,34,5,9]
输出： "9534330"

class Solution {
    public String largestNumber(int[] nums) {
        int n = nums.length;
        String[] ss = new String[n];
        for (int i = 0; i < n; i++) ss[i] = "" + nums[i];
        Arrays.sort(ss, (a, b) -> {
            String sa = a + b, sb = b + a ;
            return sb.compareTo(sa);
        });
        
        StringBuilder sb = new StringBuilder();
        for (String s : ss) sb.append(s);
        int len = sb.length();
        int k = 0;
        while (k < len - 1 &amp;&amp; sb.charAt(k) == '0') k++;
        return sb.substring(k);
    }
}