forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
_243.java
37 lines (32 loc) · 1.12 KB
/
_243.java
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
30
31
32
33
34
35
36
37
package com.fishercoder.solutions;
/**
* 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.*/
public class _243 {
public static class Solution1 {
public int shortestDistance(String[] words, String word1, String word2) {
int p = -1;
int q = -1;
int min = Integer.MAX_VALUE;
for (int i = 0; i < words.length; i++) {
if (words[i].equals(word1)) {
p = i;
}
if (words[i].equals(word2)) {
q = i;
}
if (p != -1 && q != -1) {
min = Math.min(min, Math.abs(p - q));
}
}
return min;
}
}
}