[Leetcode] 244. Shortest Word Distance II 解题报告
来源:互联网 发布:2016珠三角经济数据 编辑:程序博客网 时间:2024/06/08 03:10
题目:
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); */
- [leetcode] 244. Shortest Word Distance II 解题报告
- [Leetcode] 244. Shortest Word Distance II 解题报告
- [leetcode] 243. Shortest Word Distance 解题报告
- [Leetcode] 243. Shortest Word Distance 解题报告
- LeetCode 244. Shortest Word Distance II
- LeetCode 244. Shortest Word Distance II
- [leetcode] 245. Shortest Word Distance III 解题报告
- [Leetcode] 245. Shortest Word Distance III 解题报告
- leetcode--Shortest Word Distance II
- Leetcode: Shortest Word Distance II
- LeetCode-Shortest Word Distance II
- LeetCode Shortest Word Distance II
- leetcode--Shortest Word Distance II
- 244. Shortest Word Distance II
- 244. Shortest Word Distance II
- 244. Shortest Word Distance II
- LeetCode 题解(268) : Shortest Word Distance II
- Shortest Word Distance II
- 移动端滑屏 touch事件
- 数据库水平切分的实现原理解析---分库,分表,主从,集群,负载均衡器
- 回滚 rollback
- 快速删除docker中的容器
- lintcode(207)区间求和 II
- [Leetcode] 244. Shortest Word Distance II 解题报告
- canvas-基本应用-例子1
- 11.1-全栈Java笔记:多线程技术的基本概念
- VUE引入第三方插件
- Base64编码 详解
- NodeJS之process对象
- 关于数据库对应的jar包、驱动类名和URL格式
- zoj 3123 尺取法
- excel批量转sql语句