Das deutsche Python-Forum

Code: Alles auswählen

def try3():
    a=['a1', 'a2', 'a3']
    b=['b1','b2']
    c=['c1', 'c2', 'c3']
    savList=[['A', a],['B', b], ['C', c]]
    entryList=[]
   
    timesToIterate=len(savList)
    #iterate over A, B, C
    for iConfigs in range(timesToIterate):
        #iterate over entries of A, B, C
        for firstSa in range(len(savList[iConfigs][1])):
            #add every single entry of A, B, C solely
            entryList.append(savList[iConfigs][1][firstSa])
            #if more than one entry in list (more than A) add entries of B and C and...
            if timesToIterate>1:
                for nextConfig in range(1,len(savList)-1):
                    #number of entries per Config A:3, B:2, C:3
                    numberSAsPerConfig=len(savList[nextConfig][1])
                    #do only, if not the last (this case C)
                    if iConfigs<timesToIterate-1:
                        #first add entry from first entry (A, so add a1)
                        appendTemp.append(savList[iConfigs][1][firstSa])
                        #than add all other configs
                        ...??recursive funtion here??
                        ...
                                    
                        entryList.append(appendTemp)
                  
    print str(entryList)

Code: Alles auswählen

from itertools import permutations, product


def main():
    data = [['A', ['a1']], ['B', ['b1', 'b2']], ['C', ['c1', 'c2']]]
    xs = [tuple(x[1]) for x in data]
    result = list()
    for i in xrange(1, len(data) + 1):
        for ps in set(tuple(sorted(x)) for x in permutations(xs, i)):
            result.extend(product(*ps))
    result.sort()
    print result


if __name__ == '__main__':
    main()