This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2.
Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
word1 and word2 may be the same and they represent two individual words in the list.
For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"]
.
Given word1 = “makes”
, word2 = “coding”
, return 1.
Given word1 = "makes"
, word2 = "makes"
, return 3.
public class Solution {
public int shortestWordDistance(String[] words, String word1, String word2) {
if(words == null || words.length == 0){
return 0;
}
int index1 = -1;
int index2 = -1;
int res = Integer.MAX_VALUE;
for(int i=0; i<words.length; i++){
int t = index1;
if(words[i].equals(word1)){
index1 = i;
}
if(words[i].equals(word2)){
index2 = i;
}
if(index1 != -1 && index2 != -1){
if(word1.equals(word2) && t != -1 && t != index1){ //3个条件缺一不可
res = Math.min(res, Math.abs(index1 - t));
}else if(index1 != index2){ //两个数不一样是才走这条路
res = Math.min(res, Math.abs(index1 - index2));
}
}
}
return res;
}
}