题目:
有个内含单词的超大文本文件,给定任意两个单词,找出在这个文件中这两个单词的最短距离(相隔单词数)。如果寻找过程在这个文件中会重复多次,而每次寻找的单词不同,你能对此优化吗?
示例:
输入:words = ["I","am","a","student","from","a","university","in","a","city"], word1 = "a", word2 = "student"
输出:1
代码:
class Solution {
public int findClosest(String[] words, String word1, String word2) {
int l=Integer.MAX_VALUE;
int w1=-1;
int w2=-1;
for(int i=0;i<words.length;i++){
if(words[i].equals(word1)||words[i].equals(word2)){
if(words[i].equals(word1)){
w1=i;
}else{
w2=i;
}
if(w1!=-1&&w2!=-1){
int a=Math.abs(w1-w2);
if(a<l){
l=a;
}
}
}
}
return l;
}
}