https://leetcode.com/problems/largest-number/
参考
这里要注意cmp 函数的写法. return的是1还是-1
def cmp(self, a, b):
sa = str(a) + str(b)
sb = str(b) + str(a)
if sa > sb:#a比b大,那么就要把a放在list的后面的位置,但是这里要reverse = True,所以这里要是-1
return -1
elif sa == sb:
return 0
elif sa < sb:
return 1
http://yucoding.blogspot.hk/2015/03/leetcode-question-largest-number.html
http://bookshadow.com/weblog/2015/01/13/leetcode-largest-number/