擅长:python、mysql、java
<p>如果您试图实现<a href="https://stackoverflow.com/questions/1988804/what-is-memoization-and-how-can-i-use-it-in-python">Memoization</a>,那么这是跟踪历史结果以减少计算并加快程序速度的好方法。下面是关于如何开始的示例代码</p>
<pre><code>history = dict()
def findSongs(jukeBox):
search = input('Enter a word you want to search in the dataset:')
cnt=0
if search in history.keys():
# The search term exists, to access the previous result -
# - from the dict: history[search]
else:
for artist in jukeBox:
artist = artist.strip().split(',')
if search.lower() in ''.join(artist).lower():
cnt+=1
print('\n\nFound' , cnt, 'matches:\n \n')
for artist in jukeBox:
artist = artist.strip().split(',')
if search.lower() in ''.join(artist).lower():
printSong(artist[0],artist[1],artist[2],artist[3])
# Makre sure to update the dictionary here
# history[search] = [results list]
# or history[search] = history[search].append(newElement)
</code></pre>