leetcode
python快速排序:
def quickSort(num):
if num.__len__() < 2:
return num
left,right = [],[]
base = num.pop()
for val in num:
if val < base:
left.append(val)
else:
right.append(val)
return quickSort(left)+[base]+quickSort(right)