243. Shortest Word Distance.java

public class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        int w1 = -1;
        int w2 = -1;
        int dist = Integer.MAX_VALUE;
        
        for (int i = 0; i < words.length; i++) {
            if (words[i].equals(word1)) {
                w1 = i;
            }
            if (words[i].equals(word2)) {
                w2 = i;
            }
            if ((w1 != -1 && w2 != -1) && Math.abs(w1 - w2) < dist) {
                dist = Math.abs(w1 - w2);
            }
        }
        
        return dist;
    }
}