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.

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.

链接： http://leetcode.com/problemset/algorithms/

3/2/2017,

string的比较用equals，不是＝＝

public class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        int index = Integer.MAX_VALUE;
        int m = -1, n = -1;
        for (int i = 0; i < words.length; i++) {
            if (words[i].equals(word1)) {
                if (n != -1 && i - n < index) index = i - n;
                m = i;
            } else if (words[i].equals(word2)) {
                if (m != -1 && i - m < index) index = i - m;
                n = i;
            }
        }
        return index;
    }
}