【发布时间】:2014-09-18 15:53:57
【问题描述】:
对于最近的脚本,我必须通过分支树迭代可能的流。我构建了一个字典,其中包含每个项目的运行状态,以便我进行评估。例如:
for a in range(0, 2):
for b in range(0, 2):
for c in range(0, 2):
for d in range(0, 2):
...
run = [a,b,c,d ...]
不幸的是,它开始时规模很小,但后来发展到十几个州。如何减少这种情况以消除所有嵌套循环?
如果某些州有 3 个或 4 个州而不是 2 个州,类似的答案会有所不同吗?
同样,如果每个循环都来自函数列表,同样的问题会受到怎样的影响?我怀疑它会是一样的。例如:
def leet_lookup(char):
table = {"a": ["a","A","@"],
"b": ["b", "B", "8"],
"c": ["c", "C", "<"],
"e": ["e", "E", "3"],
"i": ["i", "I", "1"],
"l": ["l", "L", "1"],
"o": ["o", "O", "0"],
"t": ["t", "T", "7"] }
try:
result = table[char.lower()]
except KeyError:
result = [char.lower(), char.upper()]
return result
result = []
# V o l l e y b a l l = 10 chars
for c1 in leet_lookup('v'):
for c2 in leet_lookup('o'):
for c3 in leet_lookup('l'):
for c4 in leet_lookup('l'):
for c5 in leet_lookup('e'):
for c6 in leet_lookup('y'):
for c7 in leet_lookup('b'):
for c8 in leet_lookup('a'):
for c9 in leet_lookup('l'):
for c10 in leet_lookup('l'):
result.append("%s%s%s%s%s%s%s%s%s%s" % (c1, c2, c3, c4, c5, c6, c7, c8, c9, c10))
【问题讨论】:
标签: python for-loop nested-loops