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.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
| public class Solution {
public int shortestDistance(String[] words, String word1, String word2) {
Map<String, List<Integer>> map = new HashMap<>();
for (int i = 0; i < words.length; i++) {
String s = words[i];
List<Integer> list;
if (map.containsKey(s)) {
list = map.get(s);
} else {
list = new ArrayList<>();
}
list.add(i);
map.put(s, list);
}
List<Integer> l1 = map.get(word1);
List<Integer> l2 = map.get(word2);
int min = Integer.MAX_VALUE;
for (int a : l1) {
for (int b : l2) {
min = Math.min(Math.abs(b - a), min);
}
}
return min;
}
}
|