Leetcode 245. Shortest Word Distance III (Medium) (cpp)

最新推荐文章于 2025-06-03 21:36:41 发布

原创最新推荐文章于 2025-06-03 21:36:41 发布 · 455 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

C++

Leetcode C++

Leetcode Array

本文介绍了解决LeetCode上245题最短单词距离III的方法，该题允许输入的两个单词相同。通过遍历单词列表并记录匹配到的单词位置，实现了寻找两单词间最短距离的算法。

Leetcode 245. Shortest Word Distance III (Medium) (cpp)

Tag: Array

Difficulty: Medium

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

/*

245. Shortest Word Distance III (Medium)

This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2.

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.

For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Given word1 = “makes”, word2 = “coding”, return 1.
Given word1 = "makes", word2 = "makes", return 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 p1 = -1, p2 = -1, mindis = INT_MAX, prep1;
        for (int k = 0; k < words.size(); k++) {
            if (isMatched(words[k], word1)) {
                prep1 = p1;
                p1 = k;
            }
            if (isMatched(words[k], word2)) {
                p2 = k;
            }
            if (p1 != -1 && p2 != -1) {
                if (p1 == p2) {
                    if (prep1 != -1) {
                        mindis = min(mindis, abs(prep1 - p2));
                    }
                } else {
                    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;
    }
};

标签

#leetcode #cpp