[Swift]LeetCode243.最短单词距离 $ Shortest Word Distance

Given a list of words and two words word1 and word2, 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, and word1 and word2 are both in the list.

---

给定单词列表以及单词1和单词2，返回列表中这两个单词之间的最短距离。

例如，

假设words=[“practice”、“makes”、“perfect”、“coding”、“makes”]。

给定word1=“coding”，word2=“practice”，返回3。

给定word1=“makes”，word2=“coding”，返回1。

注：

您可以假定word1不等于word2，word1和word2都在列表中。

---

class Solution {
    func shortestDistance(_ words: [String],_ word1:String,_ word2:String) -> Int {
        var idx:Int = -1
        var res:Int = Int.max
        for i in 0..<words.count
        {
            if words[i] == word1 || words[i] == word2
            {
                if idx != -1 && words[idx] != words[i]
                {
                    res = min(res, i - idx)
                }
                idx = i
            }
        }
        return res
    }
}