03 2013 档案

摘要：classnode:def__init__(self, data, left, right):self.data = dataself.left = leftself.right = rightdeftree2list(root):ifroot ==None:returnNone,Noneifroot.left ==Noneandroot.right ==None:returnroot, root right = root.right head, tail = tree2list(root.left) tail.right = root root.left = tail head2, tail 阅读全文

摘要：defswap(a, b):returnb, adefperminate(array, start, end):ifstart == end:printarrayreturn N = len(array)foriinrange(start, N): array[i], array[start] = swap(array[i], array[start]) perminate(array, start+1, end) array[i], array[start] = swap(array[i], array[start])a = [1,2,3,4]perminate(a, 0, len(a)-1 阅读全文