题目
https://leetcode-cn.com/problems/ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof/
思路
- 将字符串排序
- 连接之后,转换成整型
代码
import functools
class Solution:
def minNumber(self, nums: List[int]) -> str:
# 1. 将字符串排序
# 2. 连接之后,转换成整型
def cmp(a, b):
return 1 if a+b > b+a else -1
nums = sorted([str(num) for num in nums], key=functools.cmp_to_key(cmp))
return ''.join(num for num in nums)