Leetcode 179

leetcode 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”

String Sort

class Solution {
    public String largestNumber(int[] nums) {
        if(nums == null || nums.length == 0)
            return "";
        StringBuilder sb = new StringBuilder();
        //int[] -> string[]
        String[] str = new String[nums.length];
        for(int i=0; i<nums.length; i++){
            str[i] = String.valueOf(nums[i]);
        }
        
        Arrays.sort(str, new Comparator<String>(){
            public int compare(String a, String b){
                String order1 = a+b;
                String order2 = b+a;
                return order2.compareTo(order1);
            }
        });
        
        if(str[0].equals("0"))
            return "0";
        
        for(String s:str){
            sb.append(s);
        }
        
        return sb.toString();
    }
}

限制点

1. compareTo用法
   
2. String类型的排序

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