如何用Python优雅实现指定范围、大小的元组（含/不含重复）全组合生成

Hey there! You're absolutely right that manual iteration is clunky here—Python's standard library has perfect tools for this kind of combinatorics problem, making the code both elegant and efficient. Let's break down exactly how to handle each scenario you mentioned (and clarify a quick terminology mix-up from your example first):

Quick note: Your example shows all ordered pairs including duplicates like (1,1), which is actually the scenario where element repetition is allowed and order matters. It sounds like you might have mixed up the labels, so I'll cover all four common combinatorial cases to match every possible interpretation of "allow duplicate combinations".

1. Ordered Combinations with Element Repetition (Your Example Output) #

This is the Cartesian product of the range with itself n times. Use itertools.product()—it's made exactly for this:

import itertools

# Define your parameters
num_range = range(1, 6)  # Covers 1 to 5 inclusive
tuple_size = 2
allow_element_repeats = True

# Generate combinations
if allow_element_repeats:
    results = list(itertools.product(num_range, repeat=tuple_size))

print(results)

This will output exactly the list you provided: (1,1), (1,2), ..., (5,5) (25 total combinations).

2. Ordered Combinations Without Element Repetition #

If you want ordered tuples where no element appears more than once (e.g., (1,2) is allowed but (1,1) is not, and (2,1) counts as a distinct entry), use itertools.permutations():

results = list(itertools.permutations(num_range, tuple_size))

This gives you 20 unique ordered pairs (5 choices for the first element, 4 for the second).

3. Unordered Combinations Without Element Repetition #

If order doesn't matter and elements can't repeat (e.g., (1,2) is the same as (2,1) and only counted once), use itertools.combinations():

results = list(itertools.combinations(num_range, tuple_size))

This produces 10 unique unordered pairs (the classic "n choose k" combination).

4. Unordered Combinations With Element Repetition #

If order doesn't matter but elements can repeat (e.g., (1,1) is allowed, and (1,2) is treated as identical to (2,1)), use itertools.combinations_with_replacement():

results = list(itertools.combinations_with_replacement(num_range, tuple_size))

This gives you 15 combinations, including pairs like (1,1) and (3,3).

Why This Is Pythonic #

• These functions are part of Python's standard library (itertools), so no extra dependencies are needed.
• They're implemented in C under the hood, making them way faster than any manual iteration loop you'd write.
• The code is concise, readable, and follows Python's "batteries included" philosophy—no need to reinvent the wheel.

内容的提问来源于stack exchange，提问作者mCs