Leetcode NO.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.
本题思路还是比较直接的，就是one-pass，从头遍历，用两个变量存储此时最靠后的word1和word2的position，然后相减，和之前的最小值比较。。。。感觉还是代码比我说的清晰，直接看代码把：
class Solution {
public:
int shortestDistance(vector<string>& words, string word1, string word2) {
int pos1 = -1;
int pos2 = -1;
int mindis = INT_MAX;
for (int i = 0; i < words.size(); ++i) {
if (words[i] == word1) {
pos1 = i;
}
else if (words[i] == word2) {
pos2 = i;
}
if (pos1 != -1 and pos2 != -1) {
mindis = min(mindis, abs(pos1 - pos2));
}
}
return mindis;
}
};