LeetCode 243. 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. 需要实时的记录word1和word2的坐标。
2. 遍历一次，更新word1和word2的坐标，更新一次，就求坐标差然后看是否是最小距离！

int shortestDistance(vector<string>& words, string word1, string word2) {    int res=INT_MAX;    int pos1=-1,pos2=-1;    for(int i=0;i<words.size();i++){        if(pos1>=0&&pos2>=0){            res=min(res,abs(pos1-pos2));            }        if(words[i]==word1) pos1=i;        else if(words[i]==word2) pos2=i;    }    return res;}