Words combinations without repetition
问题 I have 10 words. How can I get all possible combinations of 5 words (n=10, k=5) . The order does not matter . For example: "A", "B", "C", if k=2 (n=3 in this case) , it would like AB, BC and AC. Maybe you know some usefull code or example. P.S. Sorry if I'm not right enough cause I don't know English very good. 回答1: What you are trying to do is get all the permutations of a collection. Unique permutations of list permutations of k objects from a set of n algorithm Here is the code snippet: