擅长:python、mysql、java
<p>您可以使用<a href="https://github.com/JDonner/SuffixTree" rel="nofollow">suffix tree</a>:</p>
<pre><code>#!/usr/bin/env python2
from SuffixTree import SubstringDict # $ pip install https://github.com/JDonner/SuffixTree/archive/master.zip
d = { "key1":"valA", "key123":"valB", "key1XY":"valC",
"key2":"valD", "key2-22":"valE" }
a = '\n' # anchor
prefixes = SubstringDict()
for key, value in d.items(): # populated the tree *once*
prefixes[a + key] = value # assume there is no '\n' in key
for query in ["key1", "key2"]: # perform queries
print query, prefixes[a + query]
</code></pre>
<h3>输出</h3>
^{pr2}$