[Leetcode] 244. Shortest Word Distance II 解题报告

最新推荐文章于 2023-05-26 20:29:55 发布

魔豆Magicbean

最新推荐文章于 2023-05-26 20:29:55 发布

阅读量809

点赞数

CC 4.0 BY-SA版权

分类专栏： IT公司面试习题文章标签： Leetcode 解题报告 Hash

本文链接：https://blog.youkuaiyun.com/magicbean2/article/details/73939809

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一种针对重复查询最短单词距离问题的优化算法。通过预先存储每个单词出现的位置，实现快速查找两个单词间的最短距离。适用于单词列表固定、查询需求频繁的场景。

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

题目：

This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be called repeatedly many times with different parameters. How would you optimize it?

Design a class which receives a list of words in the constructor, and implements a method that takes two words word1 and word2 and 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 WordDistance {
public:
    WordDistance(vector<string> words) {
        for (int i = 0; i < words.size(); ++i) {
            hash[words[i]].push_back(i);
        }
    }
    
    int shortest(string word1, string word2) {
        int i = 0, j = 0, ret = INT_MAX;
        while (i < hash[word1].size() && j < hash[word2].size()) {
            ret = min(ret, abs(hash[word1][i] - hash[word2][j]));
            hash[word1][i] < hash[word2][j] ? ++i : ++j;
        }
        return ret;
    }
private:
    unordered_map<string, vector<int>> hash;
};

/**
 * Your WordDistance object will be instantiated and called as such:
 * WordDistance obj = new WordDistance(words);
 * int param_1 = obj.shortest(word1,word2);
 */