实现代码
class Solution:
#快排
def quick_sort(self,arr,left,right):
if left>right:return
i = left
j = right
temp = arr[left]
while i!=j:
while arr[j]+temp>=temp+arr[j] and i<j:
j -= 1
while arr[i]+temp<=temp+arr[i] and i<j:
i += 1
if i<j:
arr[i],arr[j] = arr[j],arr[i]
arr[left],arr[i] = arr[i],arr[left]
self.quick_sort(arr,left,i-1)
self.quick_sort(arr,i+1,right)
return arr
#希尔排序
def shell_sort(self,arr):
n = len(arr)
gap = n//2
while gap>0:
for i in range(gap,n):
tmp = arr[i]
j = i
while j>=gap and arr[j-gap]+tmp>tmp+arr[j-gap]:
arr[j] = arr[j-gap]
j -=gap
#gap的前半段
arr[j] = tmp
gap = gap//2
return arr
def PrintMinNumber(self, numbers):
# write code here
if not numbers: return ""
strs = [str(num) for num in numbers]
#self.quick_sort(strs, 0, len(strs)-1)
self.shell_sort(strs)
return ''.join(strs)
if len(self.stack)==0:
return None
return self.min_stack[-1]