Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
Given word1 = “coding”, word2 = “practice”, return 3.
Given word1 = "makes", word2 = "coding", return 1.
Note:
You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.
一刷
题解：
注意，一个单词可能在array中出现多次，取distance最小的那一组
public class Solution {
public int shortestDistance(String[] words, String word1, String word2) {
int p1=-1, p2=-1;
int min = Integer.MAX_VALUE;
for(int i=0; i<words.length; i++){
if(words[i].equals(word1)) {
p1 = i;
if(p2!=-1){
min = Math.min(min, Math.abs(p1-p2));
}
}
if(words[i].equals(word2)){
p2 = i;
if(p1!=-1){
min = Math.min(min, Math.abs(p1-p2));
}
}
}
return min;
}
}
