@@ -0,0 +1,953 @@
+package org.speedfirst.leetcode.string;%0A%0Aimport java.util.ArrayList;%0Aimport java.util.List;%0A%0A/**%0A * @author jiankuan%0A * @since 1/15/15%0A */%0Apublic class LargestNumber %7B%0A    public String largestNumber(int%5B%5D num) %7B%0A        List%3CString%3E strs = new ArrayList%3C%3E();%0A        for (int n: num) %7B%0A            strs.add(String.valueOf(n));%0A        %7D%0A%0A        strs.sort((String s1, String s2) -%3E (s2 + s1).compareTo(s1 + s2));%0A%0A        int i = 0;%0A        while (i %3C strs.size() && strs.get(i).equals(%220%22)) %7B%0A            i++;%0A        %7D%0A%0A        if (i == strs.size()) %7B%0A            return %220%22;%0A        %7D%0A%0A        StringBuilder sb = new StringBuilder();%0A        while (i %3C strs.size()) %7B%0A            sb.append(strs.get(i));%0A            i++;%0A        %7D%0A%0A        return sb.toString();%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        int%5B%5D num = new int%5B%5D%7B1%7D;%0A        String res = new LargestNumber().largestNumber(num);%0A        System.out.println(res);%0A    %7D%0A%7D

add LargestNumber solution