在多维数组中查找可能组合的整数值

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

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

def find_combinations_recursive(array, target, current_combination, start_index, combinations):
    if start_index >= len(array):
        if target == 0:
            combinations.append(current_combination[:])
        return
    
    for i in range(len(array[start_index])):
        current_combination.append(array[start_index][i])
        find_combinations_recursive(array, target - array[start_index][i], current_combination, start_index + 1, combinations)
        current_combination.pop()

# 示例用法
array = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
target = 10
result = find_combinations(array, target)
print(result)