是否有像无气味功能那样具有动态循环数的方法?
字母是字符['a','b','c','d']
上的数组,并且
letterdict是一本字典{'a':['b','c'],'b':['a'],'c':['d'],'d':['b','c','d']
我的代码是n = 13的代码:
for x in letters:
for k1 in letterdict[x]:
for k2 in letterdict[k1]:
for k3 in letterdict[k2]:
for k4 in letterdict[k3]:
for k5 in letterdict[k4]:
for k6 in letterdict[k5]:
for k7 in letterdict[k6]:
for k8 in letterdict[k7]:
for k9 in letterdict[k8]:
for k10 in letterdict[k9]:
for k11 in letterdict[k10]:
for k12 in letterdict[k11]:
for k13 in letterdict[k12]:
word=""
word=x+k1+k2+k3+k4+k5+k6+k7+k8+k9+k10+k11+k12+k13
print(word)
但是我想为n个循环使用相同的代码 像这样:
n = 3
for x in letters:
for k1 in letterdict[x]:
for k2 in letterdict[k1]:
for k3 in letterdict[k2]:
word=""
word=x+k1+k2+k3
print(word)
答案 0 :(得分:2)
通常,当您发现自己需要无限多个嵌套循环时,应改为编写一个递归函数。这是一个生成器函数的实现:
def generate_strings(letters, transitions, k):
def helper(s):
if len(s) == k:
yield s
elif len(s) < k:
for letter in transitions[s[-1]]:
yield from helper(s + letter)
for letter in letters:
yield from helper(letter)
示例:请注意,由于字符串也是字符序列,因此不必使用字符列表。
>>> letters = 'abcd'
>>> transitions = {'a': 'bc', 'b': 'a', 'c': 'd', 'd': 'bcd'}
>>> for s in generate_strings(letters, transitions, 4):
... print(s)
...
abab
abac
acdb
acdc
acdd
baba
bacd
cdba
cdcd
cddb
cddc
cddd
dbab
dbac
dcdb
dcdc
dcdd
ddba
ddcd
dddb
dddc
dddd