leetcode 单词距离

1.题目要求:

有个内含单词的超大文本文件，给定任意两个不同的单词，找出在这个文件中这两个单词的最短距离(相隔单词数)。如果寻找过程在这个文件中会重复多次，而每次寻找的单词不同，你能对此优化吗?

示例：

输入：words = ["I","am","a","student","from","a","university","in","a","city"], word1 = "a", word2 = "student"
输出：1
提示：

words.length <= 100000

2.题目代码:

int findClosest(char** words, int wordsSize, char* word1, char* word2){
    int i = 0;
    int j = 0;
    //1.设置两个数组存入有word1的下标，存入有word2的下标
    int* word1index = (int*)malloc(sizeof(int) * wordsSize);
    int j1 = 0;
    int* word2index = (int*)malloc(sizeof(int) * wordsSize);
    int j2 = 0;
    //遍历数组，采用strcmp函数，如果相同，则存入它的下标
    for(i = 0;i < wordsSize;i++){
        if(strcmp(words[i],word1) == 0){
            word1index[j1] = i;
            j1++;
        }else if(strcmp(words[i],word2) == 0){
            word2index[j2] = i;
            j2++;
        }
    }
    //设置数组，存入两数组之间所有的数之间的差
    int* diff = (int*)malloc(sizeof(int) * 100000);
    int f = 0;
    for(i = 0;i < j1;i++){
        for(j = 0;j < j2;j++){
            diff[f] =abs(word1index[i] - word2index[j]);
            f++;
        }
    }
    //找到最小值返回
    int min = diff[0];
    for(i = 1;i < f;i++){
        if(min > diff[i]){
            min = diff[i];
        }
    }
    return min;
}