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 word1does not equal toword2, and word1 and word2 Both are in the list.
This question is repeated carefully.
public class Solution { public int shortestDistance(String[] words, String word1, String word2) { int w1 = -1; int w2 =-1; int min = Integer.MAX_VALUE; for(int i=0; i This siteOriginal articleAll follow "Attribution-NonCommercial-ShareAlike 4.0 License (CC BY-NC-SA 4.0)Please retain the following annotations when sharing or adapting:
Original author:Jake Tao,source:「LeetCode – 243. Shortest Word Distance」
