Note: I'm working in python on this.
For example, given a list:
list = ['a','b','c','d','e','f','g','h','i','j']
I want to generate a list of lists with all possible 3-item combinations:
['a','b','c'],
['a','b','d'],
['a','b','e']
The permutations should not use the same item twice in a permutation, but the order is important and represents distinct permutations that should be included, e.g.,
['a','b','c'],
['a','c','b']
Should both be included.
"3" is the magic length for the permutations I'm looking to generate, but I wouldn't look down on a solution for arbitrary length permutations.
Thanks for any help!
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…