Leetcode 刷题 - 245 - Shortest Word Distance III

This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2.

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.

word1 and word2 may be the same and they represent two individual words in the list.

For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Given word1 = “makes”, word2 = “coding”, return 1.
Given word1 = "makes", word2 = "makes", return 3.

Note:
You may assume word1 and word2 are both in the list.

根据题意，唯一需要考虑的就是两个需要判断距离的词，可能是相同的，那么有可能会出现distance = 0的可能性。只要排除这个就可以了。

class Solution(object):
    def shortestWordDistance(self, words, word1, word2):

        dic = {}
        for index, value in enumerate(words): # 把数据都存在字典中
            if value not in dic:
                dic[value] = [index]
            else:
                dic[value] += index,

        return min(set(abs(x-y) for x in dic[word1] for y in dic[word2]) - set([0])) # 利用set的bit操作去掉0的可能性

因为仅仅需要两个词的所有index就可以，所以可以用list替换dic字典。

class Solution2(object):
    def shortestWordDistance(self, words, word1, word2):

        w1 = [i for i in xrange(len(words)) if words[i] == word1]
        w2 = [i for i in xrange(len(words)) if words[i] == word2]

        return min(set(abs(x-y) for x in w1 for y in w2) - set([0]))