时隔两年又要开始刷LeetCode了,又忘差不多了,小菜鸡又来打打基础啦,听说y神的课很棒,就来听听学学做做笔记啦!
快排
arr = [3,2,4,5,0,3]
def qsort(A,l,r):
if l >= r: return #双指针边界
x, i, j = A[(l+r+1)//2], l-1, r+1
while i < j:
i += 1
while A[i]<x: i += 1
j -= 1
while A[j]>x: j -= 1
if i < j:
A[i], A[j] = A[j], A[i]
qsort(A, l, i-1)
qsort(A, i, r)
qsort(arr, 0, len(arr)-1)
print(arr)