[leetcode]243. 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.

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

Input: word1 = “coding”, word2 = “practice”
Output: 3

Input: word1 = "makes", word2 = "coding"
Output: 1

题意：

给定一列单词和俩单词，求这俩单词在一列中的最短距离。

Solution1: Two Pointers

扫words，若当前指针i 对应元素等于word1, 则将 i 赋给 a

              若当前指针i 对应元素等于word2, 则将 i 赋给 b

              同时更新result 

code

class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        int result = Integer.MAX_VALUE;
        int a = -1;   // word1Idx
        int b = -1;   // word2Idx
        for(int i = 0; i< words.length; i++){
            if(words[i].equals(word1)){
                a = i;
            }else if(words[i].equals(word2)){
                b = i;
            }
            if(a!=-1 && b !=-1){
            result = Math.min(result, Math.abs(a-b));
            }       
        }
        return result;
    }
}