I need help coming up with a function in python that can take 3 arguements as lists and give me all combinations of there elements -
this question has answer here:
what have far pretty nothing
def dress_me(shirt, tie, suit): # if type(shirt) != list or type(tie) != list or type(suit) != list: # return none combinations = dress_me(shirt, tie, suit) combo in combinations: print(combo)
use itertools.product
:
def dress_me(shirt, tie, suit): if type(shirt) != list or type(tie) != list or type(suit) != list: return none return list(itertools.product(shirt, tie, suit))
demo:
>>> dress_me([1,2,3],[4,5,6],[7,8,9]) [(1, 4, 7), (1, 4, 8), (1, 4, 9), (1, 5, 7), (1, 5, 8), (1, 5, 9), (1, 6, 7), (1, 6, 8), (1, 6, 9), (2, 4, 7), (2, 4, 8), (2, 4, 9), (2, 5, 7), (2, 5, 8), (2, 5, 9), (2, 6, 7), (2, 6, 8), (2, 6, 9), (3, 4, 7), (3, 4, 8), (3, 4, 9), (3, 5, 7), (3, 5, 8), (3, 5, 9), (3, 6, 7), (3, 6, 8), (3, 6, 9)]
Comments
Post a Comment