Leetcode: 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.

 1 public class Solution {
 2     public int shortestDistance(String[] words, String word1, String word2) {
 3         int i=-1, j=-1;
 4         int min = Integer.MAX_VALUE;
 5         for (int k=0; k<words.length; k++) {
 6             if (!words[k].equals(word1) && !words[k].equals(word2)) continue;
 7             else if (words[k].equals(word1)) {
 8                 i = k;
 9             }
10             else if (words[k].equals(word2)) {
11                 j = k;
12             }
13             if (i!=-1 && j!=-1) {
14                 min = Math.min(min, Math.abs(j-i));
15             }
16         }
17         return min;
18     }
19 }