-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpermute.py
executable file
·49 lines (36 loc) · 1.22 KB
/
permute.py
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
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""Generate all possible words from provided set of letters.
"""
import logging
import math
def generate_combos(letters):
if not letters:
return letters
if len(letters) == 1:
return [letters[0]]
combos = []
for i in range(0, len(letters)):
letter_i = letters[i]
other_letters = letters[0:i] + letters[i+1:]
for subcombo in generate_combos(other_letters):
combos.append(letters[i] + subcombo)
return combos
if __name__ == '__main__':
import unittest
class TestGenerateCombos(unittest.TestCase):
def _run(self, letters):
combos = generate_combos(list(letters))
self.assertEqual(math.factorial(len(letters)), len(combos))
def test_abc(self):
self._run('abc')
def test_fraggle(self):
self._run("fraggle")
def test_none(self):
self.assertIsNone(generate_combos(None))
def test_empty_list(self):
self.assertEqual([], generate_combos([]))
def test_single_letter(self):
self.assertEqual(['a'], generate_combos(['a']))
# run tests
unittest.main()