Leetcode: Shortest Word Distance III

Question

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.

Hide Tags Array
Hide Similar Problems (E) Shortest Word Distance (M) Shortest Word Distance II

---

My Solution

class Solution(object):
    def shortestWordDistance(self, words, word1, word2):
        """
        :type words: List[str]
        :type word1: str
        :type word2: str
        :rtype: int
        """

        l1, l2 = -1, -1
        res = len(words)
        for ind,elem in enumerate(words):
            if elem==word1:
                l1 = ind
                if l2>-1 and l1!=l2:
                    res = min(res, abs(l1-l2))
            if elem==word2:
                l2 = ind
                if l1>-1 and l1!=l2:
                    res = min(res, abs(l1-l2))

        return res