179. Largest Number

Given a list of non negative integers, arrange them such that they form the largest number.

Example 1:

Input: [10,2]
Output: "210"
Example 2:

Input: [3,30,34,5,9]
Output: "9534330"

Note: The result may be very large, so you need to return a string instead of an integer.

The idea here is basically implement a String comparator to decide which String should come first during concatenation. Because when you have 2 numbers (let’s convert them into String), you’ll face only 2 cases:
For example:

String s1 = “9”;
String s2 = “31”;

String case1 = s1 + s2; // 931
String case2 = s2 + s1; // 319

Apparently, case1 is greater than case2 in terms of value.
So, we should always put s1 in front of s2.

对String排序，按照两个string组合起来的大小排序。
“9” 要 排在 “31” 前面。

class Solution {
    public String largestNumber(int[] nums) {
        int n = nums.length;
        String[] values = new String[n];
        for (int i = 0; i < n; i++) {
            values[i] = String.valueOf(nums[i]);
        }
        Arrays.sort(values, (o1, o2) -> {
            String s1 = o1 + o2;
            String s2 = o2 + o1;
            return s2.compareTo(s1);
        });
        if (values[0].equals("0")) {
            return "0";
        }
        StringBuilder sb = new StringBuilder();
        for (String s : values) {
            sb.append(s);
        }
        return sb.toString();
    }
}