Given a list of non negative integers, arrange them such that they form the largest number.
给定一组非负整数,重新排列它们的顺序使之组成一个最大的整数。
用例:
输入:[3,30,34,5,9]
输出:9534330
代码较少,解题思路在注释里
Given a list of non negative integers, arrange them such that they form the largest number.
给定一组非负整数,重新排列它们的顺序使之组成一个最大的整数。
用例:
输入:[3,30,34,5,9]
输出:9534330
代码较少,解题思路在注释里