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.

    题意解析：
    在给定的数组中， 找word1 和 word2 的最短距离

    2. public class Solution {
    3.     public int shortestDistance(String[] words, String word1, String word2) {
    5.       // 先找到word1 和 word2, 然后对位置进行做差， 找到最小的距离
    7.          /* 伪代码：
    8.       int a =  words.indexOf(word1);
    9.       int b =  words.indexOf(word2);
    10.       int distance = a - b;
    11.       int min = 0;
    12.       min = Math.min(min, distance);
    14.       */
    16.       // 从数组中找word1 和word2 的位置，如果找到就将index值赋值给pos
    17.       // pos用来记录word的位置
    18.       // 最后将 | pos2 - pos1|求得最小位置差
    20.       int pos1 = -1;
    21.       int pos2 = -1;
    22.       int result = Interger.MAX;
    23.       for(int i = 0; i < words.length; i++){
    25.               if (word1.equals(words[i])) {
    26.                   pos1 = i;
    27.           }else if(word2.equals(words[i])) {
    28.                   pos2 = i;
    29.           }
    30.           if (pos1 != -1 && pos2 != -1){
    31.                   int distance = Math.abs(pos2 - pos1);
    32.                   result = Math.min(result,  distance);
    33.           }
    34.       }
    36.       return distance;
    38.     }
    39. }