
算法
不见长安啊
这个作者很懒,什么都没留下…
展开
-
快速排序
def f(l): if len(l) == 0: return l less = [i for i in l[1:] if i <= l[0]] more = [i for i in l[1:] if i > l[0]] return f(less) + [l[0]] + f(more) import random a = [random.randint(1, 1000) for i in range(20)] print(f(a)) ..原创 2021-03-31 00:13:43 · 180 阅读 · 0 评论 -
字符串全排列
def f(l): if len(l) == 1: return l res = [] for i in range(len(l)): for j in f(l[:i] + l[i + 1:]): res.append(l[i] + j) return res原创 2021-03-31 00:03:30 · 160 阅读 · 0 评论