2019-06-17

Author: JiayangWu

0244.最短单词距离II/0244-最短单词距离II.py

@@ -0,0 +1,29 @@
+class WordDistance(object):
+
+    def __init__(self, words):
+        """
+        :type words: List[str]
+        """
+        from collections import defaultdict
+        self.words = words
+        self.record = defaultdict(list)
+        for i, word in enumerate(words):
+            self.record[word].append(i)
+        # print self.record
+    def shortest(self, word1, word2):
+        """
+        :type word1: str
+        :type word2: str
+        :rtype: int
+        """
+        res = len(self.words)
+        for pos1 in self.record[word1]:
+            for pos2 in self.record[word2]:
+                res = min(res, abs(pos1 - pos2))
+        return res
+        
+
+
+# Your WordDistance object will be instantiated and called as such:
+# obj = WordDistance(words)
+# param_1 = obj.shortest(word1,word2)

0245.最短单词距离III/0245-最短单词距离III.py

@@ -0,0 +1,29 @@
+class Solution(object):
+    def shortestWordDistance(self, words, word1, word2):
+        """
+        :type words: List[str]
+        :type word1: str
+        :type word2: str
+        :rtype: int
+        """
+        res = len(words)
+        
+        if word1 != word2:
+            pos1, pos2 = -1, -1
+            for i, word in enumerate(words):
+                if word == word1:
+                    pos1 = i   
+                elif word == word2:
+                    pos2 = i
+                if pos2 != -1 and pos1 != -1:
+                    res = min(res, abs(pos1 - pos2))
+        else:
+            pos = -1
+            for i, word in enumerate(words):
+                if word == word1:
+                    if pos != -1:
+                        # print i, pos
+                        res = min(res, i - pos)
+                    pos = i
+                        
+        return res