LeetCode 245. 最短单词距离 III

示例:
假设 words = ["practice", "makes", "perfect", "coding", "makes"].

输入: word1 = “makes”, word2 = “coding”
输出: 1

输入: word1 = "makes", word2 = "makes"
输出: 3

注意:
你可以假设 word1 和 word2 都在列表里。

class Solution {
public:
    int shortestWordDistance(vector<string>& words, string word1, string word2) {
    	int p1 = -1, p2 = -1, mindis = INT_MAX;
    	for(int i = 0; i < words.size(); ++i)
    	{
            if(word1 == word2 && words[i] == word1)
            {	//相同的情况
                if(p1 != -1)
                    mindis = min(mindis, i-p1);
                p1 = i;
                continue;
            }
            //不同的情况
    		if(words[i] == word1)
    			p1 = i;
    		if(words[i] == word2)
    			p2 = i;
    		if(p1 != -1 && p2 != -1)
    			mindis = min(mindis, abs(p1-p2));
    	}
    	return mindis;
    }
};