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.
Solution1：遍历
Time Complexity: O(N) Space Complexity: O(1)
Solution2：先建hashmap，call时binary search
Init: Time Complexity: O(N) Space Complexity: O(N)
call: O(#repeat)
Solution1 Code：
class Solution1 {
public int shortestDistance(String[] words, String word1, String word2) {
int p1 = -1, p2 = -1, min = Integer.MAX_VALUE;
for (int i = 0; i < words.length; i++) {
if (words[i].equals(word1))
p1 = i;
if (words[i].equals(word2))
p2 = i;
if (p1 != -1 && p2 != -1)
min = Math.min(min, Math.abs(p1 - p2));
}
return min;
}
}
