leetcode面试题17.11单词距离

思路：

双指针。

实现：

class Solution {
public:
    int findClosest(vector<string>& words, string word1, string word2) {
        int n=words.size();
        int res=100001;
        int id1=-1,id2=-1;
        for(int i=0;i<n;i++){
            if(words[i]==word1){
                id1=i;
            }
            else if(words[i]==word2){
                id2=i;
            }
            if(id1>=0 and id2>=0){
                res=min(res,abs(id2-id1));
            }
        }
        return res;
    }
};