179. Largest Number

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

For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.

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

分治算法的拓展应用。
对数a,b,c,d，若最大组合为abcd，则组合ac必大于组合ca。由此该问题具有最优子结构，因此，只要保证局部最优就可以求出全局最优。
要考虑局部最优可以考虑构造一个比较器，构建的比较器如下：

Comparator comp = new Comparator<String>(){
            public int compare(String a, String b){
                String order1 = a + b;
                String order2 = b + a;
                return order2.compareTo(order1);
            }
        };

将该比较器代入Arrays.sort中即可求出最优排序，然后利用StringBuilder构建一个String。
代码如下：

class Solution {
    public String largestNumber(int[] nums) {
        if(nums == null || nums.length == 0)
            return "";
        int N = nums.length;
        String[] s = new String[N];
        for(int i = 0; i < N; i++)
            s[i] = String.valueOf(nums[i]);
        Comparator comp = new Comparator<String>(){
            public int compare(String a, String b){
                String order1 = a + b;
                String order2 = b + a;
                return order2.compareTo(order1);
            }
        };
        Arrays.sort(s, comp);
        StringBuilder sB = new StringBuilder("");
        for(String x : s)
            sB.append(x);
        if(sB.toString().charAt(0) == '0')
            return new String("0");
        return sB.toString();
    }
}