243最短单词距离

1.暴力

class Solution {
public:
    int shortestDistance(vector<string>& words, string word1, string word2) {
        int minDistance = words.size();
        for(int i=0;i<words.size();i++){
            if(words[i]==word1){
                for(int j=0;j<words.size();j++){
                    if(words[j]==word2){
                        minDistance = min(minDistance,abs(i-j));
                    }
                }
            }
        }
        return minDistance;
    }
};

时间复杂度：O(n^2)

2.遍历一次

class Solution {
public:
    int shortestDistance(vector<string>& words, string word1, string word2) {
        int i1=-1,i2=-1;
        int minDistance = words.size();
        for(int i=0;i<words.size();i++){
            if(words[i]==word1){
                i1=i;
            }else if(words[i]==word2){
                i2=i;
            }
            if(i1!=-1&&i2!=-1){
                minDistance = min(minDistance,abs(i1-i2));
            }
        }
        return minDistance;
    }
};

时间复杂度：O(n)