*LeetCode-Largest Number

来源：互联网发布：淘宝店主真人内衣展示编辑：程序博客网时间：2024/05/16 08:31

string有一个函数是compareTo 比较两个string大小先比长度然后每一位比直到一个比一个大

所以写了一个comparator 但是注意要用两个string先前后加起来使长度一样才有可比性

public class Solution {    public String largestNumber(int[] nums) {        if ( nums == null || nums.length == 0 )            return "";        Comparator<String> comp = new Comparator<String> (){            public int compare ( String s1, String s2 ){                String res1 = s1 + s2;                String res2 = s2 + s1;                return res2.compareTo( res1 );            }        };        String [] strs = new String [ nums.length ];        for ( int i = 0; i < nums.length; i ++ ){            strs[ i ] = Integer.toString ( nums[ i ] );        }        Arrays.sort ( strs, comp );        if ( strs[ 0 ].equals ("0") )            return "0";        StringBuilder sb = new StringBuilder();        for ( String st : strs ){            sb.append ( st );        }        return sb.toString();    }}

0 0