算法:求全排列(递归法)

摘要: 递归过程图解：代码实现：bin = arr = {}i = 0for b in bin: arr=b i+=1results = set()def permutate(arr,start,end): if start==end: results.add(''.join()) else: for m in range(sta ...