LeetCode题解(0245)：最短单词距离III(Python)

题目：​​原题链接​​（中等）

标签：数组、双指针

解法一：

class Solution:
    def shortestWordDistance(self, words: List[str], word1: str, word2: str) -> int:
        # 处理不同单词的情况
        if word1 != word2:
            i1, i2 = -1, -1

            ans = len(words)

            for i, word in enumerate(words):
                if word == word1:
                    i1 = i
                    if i2 != -1:
                        ans = min(ans, i1 - i2)
                elif word == word2:
                    i2 = i
                    if i1 != -1:
                        ans = min(ans, i2 - i1)

            return ans

        # 处理相同单词的情况
        else:
            i1 = -1
            ans = len(words)

            for i, word in enumerate(words):
                if word == word1:
                    if i1 != -1:
                        ans = min(ans, i - i1)
                    i1 = i

            return ans