599. Minimum Index Sum of Two Lists(map)
来源:互联网 发布:金十数据怎么保存桌面 编辑:程序博客网 时间:2024/04/30 13:12
https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/
题目:求两个列表共有的元素,并且下标之和最小,(多个相同返回多个)。
思路:map。。
class Solution {public: vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) { vector<string>result; map<string,int>m; int len1=list1.size(),len2=list2.size(); int min=1000000; for(int x=0;x<len1;x++) m[list1[x]]=x; for(int x=0;x<len2;x++){ if(m.find(list2[x])!=m.end()){ if(min>x+m[list2[x]]) { min=x+m[list2[x]]; result.clear(); result.push_back(list2[x]); } else if(min==x+m[list2[x]]) result.push_back(list2[x]); } } return result; }};
阅读全文
0 0
- 599. Minimum Index Sum of Two Lists(map)
- LeetCode 599. Minimum Index Sum of Two Lists(map,unordered_map)
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists
- 599Minimum Index Sum of Two Lists
- [leetcode] 599. Minimum Index Sum of Two Lists
- leetcode 599. Minimum Index Sum of Two Lists
- leetode.599. Minimum Index Sum of Two Lists
- 599. Minimum Index Sum of Two Lists的C++解法
- 【.Net码农】C# Linq及Lamda表达式应用经验之 GroupBy 分组
- mac 安装node canvas 问题解决
- 正则表达式从入门到精通(提高篇)
- 深度学习caffe平台--制作自己.lmdb格式数据集及分类标签文件
- css颜色
- 599. Minimum Index Sum of Two Lists(map)
- Java作业-研究生教师工资(接口)
- JSON数据解析(一)——原生方法
- Failed to start LSB: Bring up/down networking.
- 反而价格; 大姑家减肥
- 我的博客的第一天,从此进入前端的人生轨迹/
- 今天所学到的一些东西
- XSS常见攻击与防御
- (三)最流行的网络请求框架Rxjava2+Retrofit之文件上传