I'm trying to figure out the best way to merge two lists into all possible combinations. So, if I start with two lists like this:
list1 = [1, 2]
list2 = [3, 4]
The resulting list will look like this:
[[[1,3], [2,4]], [[1,4], [2,3]]]
That is, it basically produces a list of lists, with all the potential combinations between the two.
I've been working through itertools, which I'm pretty sure holds the answer, but I can't come up with a way to make it act this way. The closest I came was:
list1 = [1, 2, 3, 4]
list2 = [5, 6, 7, 8]
print list(itertools.product(list1, list2))
Which produced:
[(1, 5), (1, 6), (1, 7), (1, 8), (2, 5), (2, 6), (2, 7), (2, 8), (3, 5), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (4, 7), (4, 8)]
So it does all the possible combinations of items in each list, but not all the possible resulting lists. How do I get that to happen?
EDIT: The end goal is to be able to individually process each list to determine efficiency (the actual data I'm working with is more complex). So, in the original example above, it would work something like this:
list1 = [1, 2]
list2 = [3, 4]
Get first merged list: [[1,3], [2, 4]]
Do stuff with this list
Get second merged list: [[1,4], [2, 3]]
Do stuff with this list
If I got the "list of lists of lists" output I described above, then I could put it into a for loop and process on. Other forms of output would work, but it seems the simplest to work with.
[[[1,3], [2,4]], [[1,4], [2,3]]]Why a list of lists of lists? Why not a list of lists? What are the criteria? When does an item go in the 1st or 2nd list? I would expect the expected result to be[[1,3], [2,4], [1,4], [2,3]]- Tim[1, 2], [3, 4]would result in the sequences or so:1 2 3 4 / 1 3 2 4 / 1 3 4 2 / 3 4 1 2 / 3 1 4 2 / 3 1 2 4. - Dan D.list1 = [1, 2, 3];list2 = [5, 6, 7]be, almost all the answers below return different output than your accepted answer so it is not clear what you actually want, the product or premutations - Padraic Cunningham