版权声明:转载请声明转自Juanlyjack https://blog.csdn.net/m0_38088359/article/details/82750443
给定一组数字,让这些数字组合起来使得结果最小,比如给定19,67,88,则组合起来196788最小!
输入格式:第一行为数字总数,后面每行对应一个数字
思路:将数字进行排列组合,然后对结果进行冒泡排序即可。
代码如下:
number = int(input())
list1 = []
for n in range(number):
list1.append(int(input()))
def perm(listVar):
if len(listVar) == 1:
return [listVar]
retlist = []
for i in range(len(listVar)):
restList = listVar[:i] + listVar[i+1:]
perResult = perm(restList)
for x in perResult:
retlist.append(listVar[i:i+1]+x)
list_result = []
for k in retlist:
l1 = []
for z in range(len(k)):
l1.append(str(k[z]))
list_result.append(l1)
return list_result
list_result = perm(list1)
listResult_number = []
for k in list_result:
listResult_number.append(int(''.join(k)))
# print(listResult_number)
##冒泡排序
def bubble_sort(dxata):
for i in range(len(data) - 1):
indicator = False
for j in range(len(data) - 1 - i):
if data[j] > data[j + 1]:
data[j], data[j+1] = data[j+1], data[j]
indicator = True
if not indicator:
break
bubble_sort(listResult_number)
min_Number = listResult_number[0]
print(min_Number)