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.

Solution:

two pointers, update word1 and word2's positions and the distance.

public class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        if (words.length<2) return -1;
    
        int p1 = -words.length, p2 = -words.length;
        int minDis = Integer.MAX_VALUE;
        for (int i=0;i<words.length;i++){
            if (!words[i].equals(word1) && !words[i].equals(word2)) continue;

            if (words[i].equals(word1)){
                p1 = i;            
            } else {
                p2 = i;
            }
            minDis = Math.min(minDis,Math.abs(p1-p2));
        }
        return minDis;
        
    }
}