python遍历二维列表的方法解决问题_如何从python中的二维列表中获取所有可能的项目组合？...

I didn't find a better way to phrase this question in the title. If you can, please edit.

I have a list of lists like this:

a = [['a','b'],[1,2]]

now, I'd like a function that spits out all possible combination like this:

[['a',1],['a',2],['b',1],['b',2]]

where nor the number of lists in a is known in advance, nor is the length of each of the sub lists known in advance, but all the combinations that come out should contain 1 item from every sublist.

解决方案>>> list(itertools.product(*a))

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