2个列表的Python组合

Question

pythonic计算两个列表的所有产品组合的方法是什么.因此,给定两个长度列表,n我想返回2^n包含产品的长度列表.

类似list(itertools.product(on,off))但结果应该使用所有四个要素不仅对组合,如:

[(1.05, 5.53), (1.05, 3.12), (1.05, 3.75), (1.05, 4.75), (1.5, 5.53), (1.5, 3.12), (1.5, 3.75), (1.5, 4.75), (2.1, 5.53), (2.1, 3.12), (2.1, 3.75), (2.1, 4.75), (1.7, 5.53), (1.7, 3.12), (1.7, 3.75), (1.7, 4.75)]

所以更像这样:

off = [5.53,3.12,3.75,4.75]
on = [1.05,1.5,2.1,1.7]

# calculate combinations
x = combinations(on,off)

# Where... 
# x[0] = off[0] * off[1] * off[2] * off[3] i.e
# x[0] = 5.53 * 3.12 * 3.75 * 4.75
#
# x[1] = off[0] * off[1] * off[2] * on[3] i.e
# x[1] = 5.53 * 3.12 * 3.75 * 1.7
#
# x[2] = off[0] * off[1] * on[2] * on[3] i.e
# x[2] = 5.53 * 3.12 * 2.1 * 1.7
#
# ...
#
# x[15] = on[0] * on[1] * on[2] * on[3] i.e
# x[15] = 1.05 * 1.5 * 2.1 * 1.7

输出可以类似于itertools.product()方法,即 [(5.53, 3.12, 3.75, 4.75),(5.53, 3.12, 3.75, 1.7), ...] 我需要计算产品,但我对组合方法感兴趣.

注意:当我说pythonic这样做的时候,我的意思是利用蟒蛇结构,库(itertools等)的简单的一两行.

Answer 1

你非常接近,itertools.combinations().