?LeetCode刷題實戰(zhàn)243：最短單詞距離

示例:
假設 words = ["practice", "makes", "perfect", "coding", "makes"]
輸入: word1 = “coding”, word2 = “practice”
輸出: 3

輸入: word1 = "makes", word2 = "coding"
輸出: 1

注意:
你可以假設 word1 不等于 word2, 并且 word1 和 word2 都在列表里。

class Solution {
public:
    int shortestDistance(vector<string>& words, string word1, string word2) {
      int i1 = -1, i2 = -1, mindis = INT_MAX;
      for(int i = 0; i < words.size(); ++i)
      {
        if(words[i] == word1)
          i1 = i;
        else if(words[i] == word2)
          i2 = i;
        if(i1 != -1 && i2 != -1)
          mindis = min(mindis, abs(i1-i2));
      }
      return mindis;
    }
};