@@ -0,0 +1,1134 @@
+import java.util.Arrays;%0Aimport java.util.Comparator;%0A%0Apublic class LeetCode0179 %7B%0A    public String largestNumber(int%5B%5D nums)%0A    %7B%0A        if (nums == null %7C%7C nums.length == 0) %7B%0A            return %22%22;%0A        %7D%0A%0A        String%5B%5D array = new String%5Bnums.length%5D;%0A        for (int i = 0; i %3C nums.length; i++) %7B%0A            array%5Bi%5D = String.valueOf(nums%5Bi%5D);%0A        %7D%0A%0A        Arrays.sort(array, new Comparator%3CString%3E() %7B%0A%0A            @Override%0A            public int compare(String o1, String o2)%0A            %7B%0A                String str1 = o1 + o2;%0A                String str2 = o2 + o1;%0A                return str2.compareTo(str1);%0A            %7D%0A        %7D);%0A%0A        if (%220%22.equals(array%5B0%5D)) %7B%0A            return %220%22;%0A        %7D%0A%0A        StringBuilder sb = new StringBuilder();%0A        for (int i = 0; i %3C array.length; i++) %7B%0A            sb.append(array%5Bi%5D);%0A        %7D%0A%0A        return sb.toString();%0A    %7D%0A%0A    public static void main(String%5B%5D args)%0A    %7B%0A        int%5B%5D nums = new int%5B%5D %7B 3, 30, 34, 5, 9 %7D;%0A        LeetCode0179 leetcode = new LeetCode0179();%0A        System.out.println(leetcode.largestNumber(nums));%0A    %7D%0A%7D%0A

Add LeetCode0179.java