class Solution {
public int findClosest(String[] words, String word1, String word2) {
int n=words.length;
int res=n;
for(int i=0,a=-1,b=-1;i<n;i++){
if(words[i].equals(word1)){
a=i;
}
if(words[i].equals(word2)){
b=i;
}
if(a!=-1&&b!=-1){
res=Math.min(res,Math.abs(a-b));
}
}
return res;
}
}