擅长:python、mysql、java
<p>对于当前状态,可以使用一个堆栈替换递归。并在<code>compare</code>方法中创建<code>result</code>数组</p>
<pre><code>def compare(trie1, trie2):
result = []
stack = [(trie1, trie2, "")]
while stack:
t1, t2, curr = stack.pop()
for i in t1:
if i not in t2:
continue
if i == "#":
result.append(curr)
else:
stack.append((t1[i], t2[i], curr + i))
return result
</code></pre>