LeetCode 243. Shortest Word Distance

最新推荐文章于 2022-04-20 13:39:22 发布

原创最新推荐文章于 2022-04-20 13:39:22 发布 · 311 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

本文介绍了一种高效的算法，用于找出列表中两个指定单词之间的最短距离。通过一次遍历和记录两个单词的位置来实现最小距离的计算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

思路：
1. 需要实时的记录word1和word2的坐标。
2. 遍历一次，更新word1和word2的坐标，更新一次，就求坐标差然后看是否是最小距离！

int shortestDistance(vector<string>& words, string word1, string word2) {
    int res=INT_MAX;
    int pos1=-1,pos2=-1;
    for(int i=0;i<words.size();i++){
        if(pos1>=0&&pos2>=0){
            res=min(res,abs(pos1-pos2));    
        }
        if(words[i]==word1) pos1=i;
        else if(words[i]==word2) pos2=i;
    }
    return res;
}