Leetcode 243. Shortest Word Distance (Easy) (cpp)

最新推荐文章于 2023-12-19 11:46:25 发布

原创最新推荐文章于 2023-12-19 11:46:25 发布 · 548 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #cpp

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Array

96 篇文章

订阅专栏

本文介绍了一种解决LeetCode 243题目的方法：找到两个指定单词在列表中的最短距离。使用C++实现，并提供了一个完整的代码示例，通过遍历字符串数组并记录两个目标单词的位置来计算距离。

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

Leetcode 243. Shortest Word Distance (Easy) (cpp)

Tag: Array

Difficulty: Easy

这是一道locked题目，给评论个“赞”呗？

/*

243. Shortest Word Distance (Easy)

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.

*/
class Solution {
public:
    int shortestDistance(vector<string>& words, string word1, string word2) {
        int p1 = -1, p2 = -1, mindis = INT_MAX;
        for (int k = 0; k < words.size(); k++) {
            if (isMatched(words[k], word1)) {
                p1 = k;
            } else if (isMatched(words[k], word2)) {
                p2 = k;
            }
            if (p1 != -1 && p2 != -1) {
                mindis = min(mindis, abs(p1 - p2));
            }
        }
        return mindis;
    }
private:
    bool isMatched(string words, string word1) {
        int len = words.length();
        if (len == word1.length()) {
            int i = 0;
            for (; i < len; i++) {
                if (words[i] != word1[i]) {
                    break;
                }
            }
            if (i == len) {
                return true;
            }
        }
        return false;
    }
};