python 生成树算法实现全排列

#!/usr/bin/python

_array = range(4)
_path = []

def full_range(array, path):
    if len(set(array)-set(path))==0:
        print path
    for i in set(array)-set(path):
        path.append(i)

        full_range(array, path)
        path.pop()

full_range(_array, _path)

转载于:https://my.oschina.net/u/592528/blog/346117