Leetcode 599. Minimum Index Sum of Two Lists | | Leetcode 599. Minimum Index Sum of Two Lists 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution12345678910111213141516171819202122232425class Solution {public: vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) { int min = INT_MAX; vector<string> result; unordered_map<string, int> m; for(int i = 0; i < list1.size(); i++) { m[list1[i]] = i; } for(int i = 0; i < list2.size(); i++) { if(m.find(list2[i]) != m.end()) { int index = m[list2[i]] + i; if(index < min) { min = m[list2[i]] + i; result.clear(); result.emplace_back(list2[i]); } else if(index == min) { result.emplace_back(list2[i]); } } } return result; }}; Reference https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏