If I have a array of an inconsistent size, lists that consists of an (inconsistent) amount of lists:
lists = [List1, List2, List3,...ListN]
where each contained list is of inconsistent size.
How can I concatenate the contents multiplicatively of each contained array.
Example of target output:
A = ["A","B","C","D"]
B = ["1","2","3","4"]
C = ["D","E","F","G"]
A[0-N] + B[0-N] + C[0-N]
Giving ["A1D","B1D","C1D","D1D",
"A2D","B2D","C2D","D2D"
"A3D","B3D","C3D","D3D"
"A4D","B4D","C4D","D4D"
"A1E","B1E","C1E","D1E"
... "C4G","D4G" ]
For this specific example it should yield a list length of 4^3. (List length to the power of the number of lists)
However list length is not constant so it is really
List1 Length * List2 Length * List3 Length * ... * ListN Length
For an inconsistent list length:
A = ["A","B"]
B = ["1","2","3","4"]
= ["A1","A2","A3","A4","B1","B2","B3","B4"]
I have tried python maps and zips, but I am having trouble doing for example:
zip(list1, list2, list3)
when:
Amount of lists is not consistent
The lists are not stored separately but collated in one large list,
and the list size is not consistent
Methods described on other SO Question only address consistent size, 2 list, situations. I am having trouble applying these techniques in this situation.