Leetcode Everyday: 243. Shortest Word Distance

https://leetcode.com/problems/shortest-word-distance/

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.

public class Solution {
public int shortestDistance(String[] words, String word1, String word2) {
int i1 = -1;
int i2 = -1;
int dis = Integer.MAX_VALUE;
for(int i = 0; i<words.length;i++){
String s = words[i];
if(s.equals(word1)){
i1 = i;
if(i2!=-1 && i1-i2<dis) dis = i1-i2;
}
if(s.equals(word2)){
i2 = i;
if(i1!=-1 && i2-i1<dis) dis = i2-i1;
}
}
return dis;
}
}