【字符串】面试题 17.11. 单词距离

题目：

 

 

 

解答：

class Solution {
public:
    int findClosest(vector<string>& words, string word1, string word2) 
    {

        int t1 = -1;
        int t2 = -1;
        int res = words.size();

        for (int i = 0; i < words.size(); i ++) 
        {
            if (words[i] == word1) 
            {
                t1 = i;
            }
            else if (words[i] == word2) 
            {
                t2 = i;
            }
            if (t1 != -1 && t2 != -1) 
            {
                res = min(res, abs(t1 - t2));
            }
            if (res == 1) 
            {
                break;
            }
        }
        return res;
    }
};