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.
用两个指针 p1, p2 代表 word1 和 word2 的位置,动态更新 p1 和 p2 的值,p1 和 p2 的差值就是当前的distance。
代码如下:
public class Solution {
public int shortestDistance(String[] words, String word1, String word2) {
int p1 = -1, p2 = -1, mindiff = words.length;
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) {
mindiff = Math.min(mindiff, Math.abs(p1 - p2));
}
}
return mindiff;
}
}