本文主要是介绍LeetCode 题解(268) : Shortest Word Distance II，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目：
This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be calledrepeatedly many times with different parameters. How would you optimize it?
Design a class which receives a list of words in the constructor, and implements a method that takes two wordsword1 and word2 and return the shortest distance between these two words in the list.
For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
Given word1 = “coding”, word2 = “practice”, return 3.
Given word1 = "makes", word2 = "coding", return 1.
Note:
You may assume that word1 does not equal to word2, andword1 and word2 are both in the list.
和上题解法一样。
Python版：
import sysclass WordDistance(object):def __init__(self, words):"""initialize your data structure here.:type words: List[str]"""self.d = {}for i in range(len(words)):if words[i] in self.d:self.d[words[i]].append(i)else:self.d[words[i]] = [i]def shortest(self, word1, word2):"""Adds a word into the data structure.:type word1: str:type word2: str:rtype: int"""s= sys.maxintfor i in self.d[word1]:for j in self.d[word2]:a = abs(i - j)if a < s:s = areturn s# Your WordDistance object will be instantiated and called as such:
# wordDistance = WordDistance(words)
# wordDistance.shortest("word1", "word2")
# wordDistance.shortest("anotherWord1", "anotherWord2")这篇关于LeetCode 题解(268) : Shortest Word Distance II的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
