在二维数组中进行所有可能的组合

array = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
]

def find_combinations(array):
    combinations = []
    find_combinations_recursive(array, 0, [], combinations)
    return combinations

def find_combinations_recursive(array, row, selected_nums, combinations):
    if row == len(array):
        combinations.append(selected_nums.copy())
        return

    for num in array[row]:
        selected_nums.append(num)
        find_combinations_recursive(array, row + 1, selected_nums, combinations)
        selected_nums.pop()

# 示例二维数组
array = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
]

combinations = find_combinations(array)
print(combinations)

[[1, 4, 7], [1, 4, 8], [1, 4, 9], [1, 5, 7], [1, 5, 8], [1, 5, 9], [1, 6, 7], [1, 6, 8], [1, 6, 9], [2, 4, 7], [2, 4, 8], [2, 4, 9], [2, 5, 7], [2, 5, 8], [2, 5, 9], [2, 6, 7], [2, 6, 8], [2, 6, 9], [3, 4, 7], [3, 4, 8], [3, 4, 9], [3, 5, 7], [3, 5, 8], [3, 5, 9], [3, 6, 7], [3, 6, 8], [3, 6, 9]]