leetcode/problems/shortest-word-distance-iii at main · awesee/leetcode

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
shortest_word_distance_iii.go		shortest_word_distance_iii.go
shortest_word_distance_iii_test.go		shortest_word_distance_iii_test.go

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.

word1 and word2 may be the same and they represent two individual words in the list.

Example:
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Input: word1 = “makes”, word2 = “coding”
Output: 1

Input: word1 = "makes", word2 = "makes"
Output: 3

Note:
You may assume word1 and word2 are both in the list.