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.

Difficulty: Easy

public class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        int index1 = -words.length, index2 = words.length, ans = words.length;
        for(int i = 0; i < words.length; i++){
            if(words[i].equals(word1))
                index1 = i;
            if(words[i].equals(word2))
                index2 = i;
            
            ans = Math.min(Math.abs(index1 - index2), ans);
        }
        return ans;
    }
}