32.把数组排成最小的数
题目描述
输入一个正整数数组,把数组里所有数字拼接起来排成一个数,打印能拼接出的所有数字中最小的一个。例如输入数组{3,32,321},则打印出这三个数字能排成的最小数字为321323。
记录
转化为字符串,进行组合比较(比较器),对列表进行排序,最后生成结果。
方法一:
两两比较,cmp返回为正,就交换位置。
#python 2.7
# -*- coding:utf-8 -*-
class Solution:
def PrintMinNumber(self, numbers):
# write code here
if not len(numbers):
return ""
arr = [str(x) for x in numbers]
arr.sort(lambda x,y:cmp(x+y,y+x))
return int("".join(arr))
#python 3
from functools import cmp_to_key
# -*- coding:utf-8 -*-
class Solution:
def PrintMinNumber(self, numbers):
if not len(numbers):
return ""
arr = [str(x) for x in numbers]
key = cmp_to_key(lambda x, y: int(x+y)-int(y+x))
arr.sort(key=key)
return ''.join(arr)
方法二:
冒泡排序。
# -*- coding:utf-8 -*-
class Solution:
def PrintMinNumber(self, numbers):
# write code here
if not len(numbers):
return ""
nums = [str(x) for x in numbers]
for i in range(len(nums)):
for j in range(i, len(nums)):
if nums[i] + nums[j] > nums[j] + nums[i]:
nums[i], nums[j] = nums[j], nums[i]
return ''.join(nums)