LeetCode #245 - Shortest Word Distance III

最新推荐文章于 2022-10-30 06:36:15 发布

LawFile

最新推荐文章于 2022-10-30 06:36:15 发布

阅读量95

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/LawFile/article/details/86662983

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定单词列表中两个特定单词之间的最短距离，包括相同单词的情况。通过遍历列表并记录位置，实现了高效的距离计算。

摘要生成于 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.

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.

如果两个单词相同，增加单独判断即可。

class Solution {
public:
    int shortestWordDistance(vector<string>& words, string word1, string word2) {
        int result=INT_MAX;
        if(word1==word2)
        {
            int pre=-1;
            for(int i=0;i<words.size();i++)
            {
                if(words[i]==word1)
                {
                    if(pre!=-1) result=min(result,i-pre);
                    pre=i;
                }
            }
        }
        else
        {
            int pos1=-1;
            int pos2=-1;
            for(int i=0;i<words.size();i++)
            {
                if(words[i]==word1)
                {
                    pos1=i;
                    if(pos2!=-1) result=min(result,i-pos2);
                }
                if(words[i]==word2)
                {
                    pos2=i;
                    if(pos1!=-1) result=min(result,i-pos1);
                }
            }
        }
        return result;
    }
};