LeetCode Shortest Word Distance

原题链接在这里：https://leetcode.com/problems/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.

题解：

Time Complexity: O(n). n = words.length.

Space: O(1).

AC Java:

 class Solution {
     public int shortestDistance(String[] words, String word1, String word2) {
         if(words == null || words.length == 0 || word1.equals(word2)){
             return 0;
         }

         int ind1 = -1;
         int ind2 = -1;
         int res = words.length;

         for(int i = 0; i < words.length; i++){
             if(words[i].equals(word1)){
                 ind1 = i;
                 if(ind2 != -1){
                     res = Math.min(res, ind1 - ind2);
                 }
             }

             if(words[i].equals(word2)){
                 ind2 = i;
                 if(ind1 != -1){
                     res = Math.min(res, ind2 - ind1);
                 }
             }
         }

         return res;
     }
 }

跟上Shortest Word Distance II, Shortest Word Distance III.