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.

Example:
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Input: word1 = “coding”, word2 = “practice”

Output: 3

Input: word1 = "makes", word2 = "coding"

Output: 1

Note: You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.

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