JZ32 把数组排成最小的数
my version
求所有排列的集合
再求最小值
注意求排列的写法
class Solution:
def __init__(self):
self.num = []
def permutation(self, numbers, start):
if start == len(numbers):
s = ''
for j in range(len(numbers)):
s += str(numbers[j])
self.num.append(s)
return
for i in range(start, len(numbers)):
if i == start or numbers[i] != numbers[start]:
numbers[i], numbers[start] = numbers[start], numbers[i]
self.permutation(numbers, start+1)
numbers[i], numbers[start] = numbers[start], numbers[i]
def PrintMinNumber(self, numbers):
if numbers:
self.permutation(numbers, 0)
return min(self.num)
return ''
book method
class Solution:
def PrintMinNumber(self, numbers):
import functools #python3中sort的cmp参数被取消了,只能调用这个库来实现
a=list(map(str,numbers))#将数字转换为字符串,储存在列表用
cmp=lambda a,b:1 if a+b>b+a else -1#具名lambda表达式
a.sort(key=functools.cmp_to_key(cmp))#调用cmp_to_key实现排序
return "".join(a)#将列表内的各个元素连接起来