Advertisement
Guest User

Untitled

a guest
Apr 27th, 2018
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.61 KB | None | 0 0
  1. def backtracking(data, candidates, result, index = 0):
  2.     if index == len(data):
  3.         result.append(tuple(data))
  4.     else:
  5.         next_index = index + 1
  6.         for iter in range(len(candidates)):
  7.             candidate = candidates[iter]
  8.             if candidate:
  9.                 data[index] = candidate
  10.                 candidates[iter] = None
  11.                 backtracking(data, candidates, result, next_index)
  12.                 candidates[iter] = candidate
  13. def permutations(s):
  14.     result = []
  15.     candidates = [i for i in s]
  16.     backtracking([None for i in s], candidates, result)
  17.  
  18.     return result
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement