例如,我在使用递归查找组合时遇到了麻烦
a = ['a', 'b','c'],
b = ['d','e','f']
c = ['g','h','i']
输入是 a,b,c 有 27 种可能的组合
combinations = []
if string == "":
print (combinations)
return
else:
for i in string.head():
recursive_combinations(combinations , string.tail())