class Solution {
public int shortestDistance(String[] words, String word1, String word2) {
if(words == null || words.length == 0){
return -1;
}
int diff = Integer.MAX_VALUE;
int index = -1;
for(int i = 0; i < words.length; i++){
if( words[i].equals(word1) || words[i].equals(word2)){
if(index != -1 && !words[index].equals(words[i])){
diff = Math.min(i - index, diff);
}
index = i;
}
}
return diff;
}
}
This is a follow up of Shortest Word Distance. The only d...
This is a follow up of Shortest Word Distance. The only d...
Problem This is a follow up of Shortest Word Distance. Th...
243: https://leetcode.com/problems/shortest-word-distance...
243: https://leetcode.com/problems/shortest-word-distance...
LeetCode 243 Shortest Word Distance I (Easy) Given a list...
class Solution { public int shortestDistance(String[] wor...
Given a list of words and two words word1 and word2, retu...
给定一个字符串数组 wordsDict，和已经存在于数组中的两个不同的字符串，返回列表中两个单词之间的最短距离。 ...
This is afollow upofShortest Word Distance. The only diff...
本文标题：Shortest Word Distance
本文链接：https://www.haomeiwen.com/subject/fvmqbxtx.html
网友评论