-
-
Save monzee/2572256 to your computer and use it in GitHub Desktop.
Convert in less than 30 lines
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| from __future__ import print_function | |
| from itertools import chain, combinations | |
| data = [ | |
| ['A', 'B', 'C'], | |
| ['A', 'C', 'E'], | |
| ['E', 'F', 'D'], | |
| ['D', 'A', 'J'], | |
| ['E', 'D', 'J'], | |
| ] | |
| pairs = map(sorted, chain(*[combinations(row, 2) for row in data])) | |
| pairfreq = sorted(set(tuple(pair) + (pairs.count(pair),) for pair in pairs)) | |
| map(print, pairfreq) | |
| """ | |
| Question: Convert following into the latter data structure in less than 30 lines: | |
| List: | |
| A, B, C | |
| A, C, E | |
| E, F, D | |
| D, A, J | |
| E, D, J | |
| List | |
| A, B, 1 (frequency) | |
| A, C, 2 | |
| A, D, 1 | |
| A, E, 1 | |
| A, J, 1 | |
| B, C, 1 | |
| C, E, 1 | |
| D, E, 2 | |
| D, F, 1 | |
| D, J, 2 | |
| E, F, 1 | |
| E, J, 1 | |
| """ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment