Shortest Word Distance III

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.

word1 and word2 may be the same and they represent two individual words in the list.

Example: Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Input: word1 = “makes”, word2 = “coding”
Output: 1

Input: word1 = "makes", word2 = "makes"
Output: 3

Note: You may assume word1 and word2 are both in the list.

assume word1 and word2 are both in the list, what I gonna do is go through the list and record the word1 and word2's location

时间复杂度 o(n)

class Solution {
    public int shortestWordDistance(String[] words, String word1, String word2) {
        if(words == null  || words.length == 0){
            return -1;
        }
        
        int p1 = words.length, p2 = - words.length, res = Integer.MAX_VALUE;
        
        for(int i = 0; i < words.length; i++){
            if(words[i].equals(word1)){
                p1 = words[i].equals(word2) ? p2 : i;
            }
            
            if(words[i].equals(word2)){
                p2 = i;
            }
            
            res = Math.min(res, Math.abs(p2 - p1));
        }
        
        return res;
    }
}