算法
Haopeng_Wu
这个作者很懒,什么都没留下…
展开
-
钢条(木条)切割问题
import time# the price of a piece of steel of a certain length, which is the indexp=[1,5,8,9,10,17,17,20,24,30]# the length of the first piece of a best split given a certain length of the steel, which is the indexbestSplit=[]# the length of the s.原创 2021-07-09 14:04:20 · 188 阅读 · 0 评论 -
输出全排列
用python语言,以递归的方式输出全排列。代码较简洁。算法复杂度O(n!),最优。最大递归深度为n。import copyout = []def permutation(a): global out if len(a) == 1: out.append(a[0]) print(out) out.pop() return for i in range(len(a)): t = copy.cop...原创 2021-07-08 23:11:39 · 115 阅读 · 0 评论