Hi,
I am looking for a clever way to compute all combinations of two lists.
Look at this example:
h = ['A','A','B','B']
m = ['a','b']
the resulting combinations should be of the same length as h and each
element in m can be used twice. The sought after result using h and m
from above is:
Hi,
thanks for your interest. Sorry for not being completely clear, yes
the length of m will always be half of the length of h.
/Steen
2012/10/3 Joshua Landau :
> On 3 October 2012 20:20, Oscar Benjamin wrote:
>>
>> On 3 October 2012 15:26, Steen Lysgaard wrote:
>>
2012/10/4 Joshua Landau :
> On 3 October 2012 21:15, Steen Lysgaard wrote:
>>
>> Hi,
>>
>> thanks for your interest. Sorry for not being completely clear, yes
>> the length of m will always be half of the length of h.
>
>
> (Please don't top post)
