企业官网建设流程全解析

res = [] stack = [([], nums)] while stack: path, remain = stack.pop() if not remain: res.append(path) continue for i in range(len(remain)): new_path = path + [remain[i]] new_remain = remain[:i] + remain[ i +1:] stack.append((new_path, new_remain)) return res

非递归方法。显示构造一个栈，存储已知路径path和未探索数字。在逐渐一次次入栈得到确定的路径并且未知未探索数字在减少。直到找到所有可能性。