Shortest Word Distance III

坚持，坚持，坚持

public class Solution {
    public int shortestWordDistance(String[] words, String word1, String word2) {
        int dist = words.length;
        int i = 0, i1 = -1, i2 = -1;
        for (; i < words.length; i++) {
            if (words[i].equals(word1)) {
                i1 = i;
                if (i2 != -1 && i1 != -1) {
                    dist = (i1 != i2) ? Math.min(dist, Math.abs(i1 - i2)) : dist;
                }
            }
			if (words[i].equals(word2)) {
                i2 = i;
                if (i2 != -1 && i1 != -1) {
                    dist = (i1 != i2) ? Math.min(dist, Math.abs(i1 - i2)) : dist;
                }
            }
        }
		return dist;
    }
}