# Quick Sort in 3 lines
def qsort(L):
if len(L) <= 1: return L
return qsort([lt for lt in L[1:] if lt < L[0]]) + L[0:1] + qsort([ge for ge in L[1:] if ge >= L[0]])python三行实现快排
最新推荐文章于 2025-05-22 17:21:41 发布
# Quick Sort in 3 lines
def qsort(L):
if len(L) <= 1: return L
return qsort([lt for lt in L[1:] if lt < L[0]]) + L[0:1] + qsort([ge for ge in L[1:] if ge >= L[0]])
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
扫一扫
1459
