两个字符串数组的乘积

def cartesian_product(arr1, arr2):
    result = []
    for item1 in arr1:
        for item2 in arr2:
            result.append((item1, item2))
    return result

# 示例数组
arr1 = ["a", "b", "c"]
arr2 = ["1", "2"]

# 计算笛卡尔积
product = cartesian_product(arr1, arr2)
print(product)

[('a', '1'), ('a', '2'), ('b', '1'), ('b', '2'), ('c', '1'), ('c', '2')]

def cartesian_product_with_padding(arr1, arr2):
    max_len = max(len(arr1), len(arr2))
    arr1 += [''] * (max_len - len(arr1))
    arr2 += [''] * (max_len - len(arr2))
    
    result = []
    for item1, item2 in zip(arr1, arr2):
        result.append((item1, item2))
    return result

# 示例数组
arr1 = ["a", "b"]
arr2 = ["1", "2", "3"]

# 计算笛卡尔积
product = cartesian_product_with_padding(arr1, arr2)
print(product)

[('a', '1'), ('a', '2'), ('a', '3'), ('b', '1'), ('b', '2'), ('b', '3')]