def quick_sort(nums):
if len(nums) > 1:
left, right = [], []
mid = nums.pop()
for i in nums:
if i <= mid:
left.append(i)
else:
right.append(i)
return quick_sort(left) + [mid] + quick_sort(right)
else:
return nums
python快排
最新推荐文章于 2023-06-23 22:24:01 发布