如何实现生成n长度A、B、C全组合的递归/嵌套循环函数？

Hey there! Let's get your function working for any non-negative integer n—whether it's 3, 10, or any other number. I'll cover both recursive and iterative approaches (plus a handy Python standard library shortcut) since you asked about recursion and nested loops.

Recursive Approach #

The core idea of recursion here is that all combinations of length n are just each character (A/B/C) prepended to every combination of length n-1. We break the problem down into smaller subproblems until we hit our base cases.

def generator(n):
    words = ["A", "B", "C"]
    # Base case 1: n=0 returns empty list (matches your original code)
    if n == 0:
        return []
    # Base case 2: n=1 is just the individual characters
    if n == 1:
        return words.copy()
    # Recursive step: build longer combinations from shorter ones
    shorter_combinations = generator(n-1)
    complete = []
    for char in words:
        for combo in shorter_combinations:
            complete.append(char + combo)
    return complete

How it works: #

• When n=3, it first calls generator(2) to get all 2-length combinations (AA, AB, AC, ..., CC).
• Then it takes each character (A/B/C) and prepends it to every 2-length combination, creating all 3-length combinations like AAA, BAA, CAA, AAB, etc.
• This logic scales infinitely—just keep breaking down to n=1, then build back up.

Iterative Approach (No Recursion) #

If recursion feels tricky, we can build the combinations iteratively by starting from length 1 and repeatedly extending the list to longer lengths. This mimics nested loops but uses a loop to handle the "nesting" dynamically.

def generator(n):
    words = ["A", "B", "C"]
    complete = []
    if n == 0:
        return complete
    # Start with all 1-length combinations
    complete = words.copy()
    # Iterate n-1 times to build up to length n
    for _ in range(n-1):
        temp = []
        # For each existing combination, append every character to make longer combinations
        for combo in complete:
            for char in words:
                temp.append(combo + char)
        # Update the list to the new longer combinations
        complete = temp
    return complete

How it works: #

• Start with ["A", "B", "C"] for n=1.
• For n=2, we take each of those and append A/B/C, resulting in 9 combinations.
• For n=3, we take those 9 and append A/B/C again, resulting in 27 combinations—exactly what you need.

Bonus: Python Standard Library Shortcut #

If you don't mind using a built-in tool, itertools.product is made for this kind of Cartesian product problem. It's concise and efficient:

import itertools

def generator(n):
    words = ["A", "B", "C"]
    if n == 0:
        return []
    # Generate all n-length Cartesian products, then convert tuples to strings
    return [''.join(combo) for combo in itertools.product(words, repeat=n)]

How it works: #

• itertools.product(words, repeat=n) generates all possible tuples of length n where each element is from words (e.g., ('A','A','A'), ('B','A','A')).
• We use ''.join(combo) to turn each tuple into a string like "AAA".

Testing the Code #

All three approaches will work for any n you input. For example, if you run:

n = int(input("Length n: "))
complete = generator(n)
print(', '.join(complete))

Entering 3 will output all 27 combinations as expected.

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