Leetcode 599 Minimum Index Sum of Two Lists
2017-10-03 11:20
465 查看
Leetcode 599 Minimum Index Sum of Two Lists
class Solution { public: vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) { unordered_map<string,int> nameAndOrder;//list1中的字符串与其对应的下标值 for(int i = 0;i < list1.size();i ++) { nameAndOrder[list1[i]] = i; } unordered_map<int,vector<string>> result;//ATTENTION 相同下标和的字符串可能会有多个,所以对应的是vector<string>,应该也可以只用一个vector int minIndexSum = list1.size() + list2.size(); for(int j = 0;j < list2.size();j ++) { auto commonName = nameAndOrder.find(list2[j]);//在list1中寻找相同的字符串commonName,commonName->second是其在list1中的下标值 if(commonName != nameAndOrder.end()) { int indexSum = commonName->second + j;//indexNum是这个字符串在两个list中的下标值之和 if(indexSum <= minIndexSum)//=等于号必须要有,结果可能是多个 { minIndexSum = indexSum; result[minIndexSum].push_back(list2[j]); } } } return result[minIndexSum];//是一个vector } };
相关文章推荐
- LeetCode 599 Minimum Index Sum of Two Lists
- LeetCode - 599 - Minimum Index Sum of Two Lists
- LeetCode Minimum Index Sum of Two Lists
- leetcode[Minimum Index Sum of Two Lists]//待整理多种解法
- 599 Minimum Index Sum of Two Lists
- HashTable-599-Minimum Index Sum of Two Lists
- [LeetCode] Minimum Index Sum of Two Lists 两个表单的最小坐标和
- Minimum Index Sum of Two Lists问题及解法
- LC-Minimum Index Sum of Two Lists
- Minimum Index Sum of Two Lists
- Minimum Index Sum of Two Lists-python
- LeetCode.599 Minimum Index Sum of Two Lists (经典:哈希表对字符串去重和List与数组间的转换)
- 599.minimum-index-sum-of-two-lists
- 刷leetcode:Intersection of Two Linked Lists
- leetcode371-----Sum of Two Integers
- LeetCode - Intersection of Two Linked Lists
- [Leetcode 160, Easy] Intersection of Two Linked Lists
- leetcode Intersection of Two Linked Lists 两链表是否相交
- leetcode_Intersection of Two Linked Lists_easy_主要是方法
- LeetCode-Intersection of Two Linked Lists