目录

力扣243. 最短单词距离

力扣243. Shortest Word Distance(最短单词距离)

给定一个字符串数组 wordsDict 和两个字符串 word1 和 word2,返回它们在数组中的最短距离。此题是会员题。

示例 1:

../posts/01_学习/87_LeetCode/0243_最短单词距离/img/0243-1-description.png

输入:wordsDict = ["practice", "makes", "perfect", "coding", "makes"], word1 = "coding", word2 = "practice"
输出:3

提示:

  • 1 <= wordsDict.length <= 3 * 10^4
  • 1 <= wordsDict[i].length <= 10
  • word1 和 word2 均在 wordsDict 中
  • word1 != word2