[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.

Hide Company Tags LinkedIn
Hide Tags Array
Hide Similar Problems (M) Shortest Word Distance II (M) Shortest Word Distance III

这道题之所以easy是因为它的note帮我们排除了很多乱七八糟的东西， 所以用两个pointer遍历一遍list即可。

class Solution {
public:
    int shortestDistance(vector<string>& words, string word1, string word2) {
        int pos1 = -1, pos2 = -1, minLen = 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 != pos2 && pos1!=-1 && pos2 != -1) minLen = min(abs(pos1-pos2), minLen);
        }
        return minLen;
    }
};