给定一个数字N 实现1~N的所有全排列刚开始是想写个递归的,结果给写成迭代了。后来发现可以写的很简单。。。class A(object): tree = [] seq="" def buildtree(self): n1 = [1,'f'] n2 = [2,'f'] n3 = [3,'f'] n4 = [4,'f'] self.tree = [n1,n
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号