GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — algorithms/algorithms/backtrack/permute.py at master · oldmonad/algorithms Expand file tree/ Copy pathpermute.pyMore file actions 54 lines (46 loc) · 1.13 KB / Copy pathpermute.pyFile metadata and controls54 lines (46 loc) · 1.13 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 """ Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1] ] """ def permute(elements): """ returns a list with the permuations. """ if len(elements) <= 1: return [elements] else: tmp = [] for perm in permute(elements[1:]): for i in range(len(elements)): tmp.append(perm[:i] + elements[0:1] + perm[i:]) return tmp def permute_iter(elements): """ iterator: returns a perumation by each call. """ if len(elements) <= 1: yield elements else: for perm in permute_iter(elements[1:]): for i in range(len(elements)): yield perm[:i] + elements[0:1] + perm[i:] # DFS Version def permute_recursive(nums): def dfs(res, nums, path): if not nums: res.append(path) for i in range(len(nums)): print(nums[:i]+nums[i+1:]) dfs(res, nums[:i]+nums[i+1:], path+[nums[i]]) res = [] dfs(res, nums, []) return res |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |