笛卡尔积

test.py

import copy


def _get_match_rule(lef_element, element_list):
    ret = []
    if len(element_list) == 1:
        for i in element_list[0]:
            new_left_element = copy.copy(lef_element)
            new_left_element.append(i)
            ret.append(new_left_element)
    else:
        for i in element_list[0]:
            new_left_element = copy.copy(lef_element)
            new_left_element.append(i)
            for ii in _get_match_rule(new_left_element, element_list[1:]):
                ret.append(ii)
    return ret


print(_get_match_rule([], [[1, 2]]))
print(_get_match_rule([], [[1, 2], [3, 4]]))
print(_get_match_rule([], [[1, 2], [3, 4], [5, 6, 7]]))

from itertools import product


def cartesian_product(element):
    return [list(combination) for combination in product(*element)]


elements = [[1, 2], [3, 4], [5, 6]]
result = cartesian_product(elements)
print(result)