[LeetCode] 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.

这题最简单的方法其实是，比较两个字符串s1和s2时，比较s1+s2和s2+s1即可。注意这里有一个特殊情况，就是组合后的字符串以0开始，需要把开始的0都去掉。

    class StringComparator implements Comparator<String> {
		@Override
		public int compare(String s1, String s2) {
			String s12 = s1 + s2;
			String s21 = s2 + s1;

			return (int) (Long.parseLong(s12) - Long.parseLong(s21));
		}
	}    
    
    public String largestNumber(int[] num) {
		StringBuilder sb = new StringBuilder();

		List<String> numStr = new ArrayList<String>();
		for (int i : num) {
			numStr.add("" + i);
		}
		Collections.sort(numStr, new StringComparator());

        <span style="white-space:pre">	</span>// Trim the leading zero(s).
		boolean HasPossibleLeading0 = true;
		for (int i = numStr.size() - 1; i >= 0; --i) {
			if (HasPossibleLeading0 && numStr.get(i).equals("0"))
				continue;
			HasPossibleLeading0 = false;
			sb.append(numStr.get(i));
		}
		if (sb.length() == 0) {
			return "0";
		}

		return sb.toString();
    }

[LeetCode] Largest Number

原文：http://blog.csdn.net/whuwangyi/article/details/42705317