查找嵌套数组的所有可能组合

def find_combinations(nested_array):
    combinations = []

    def backtrack(curr_comb, remaining):
        if len(remaining) == 0:
            combinations.append(curr_comb)
            return

        for i in range(len(remaining)):
            new_comb = curr_comb + [remaining[i]]
            backtrack(new_comb, remaining[i+1:])

    backtrack([], nested_array)
    return combinations

nested_array = [1, [2, 3], [4, 5, 6]]
combinations = find_combinations(nested_array)
print(combinations)

[[1, 2, 3], [1, 4, 5, 6]]