leetcode算法题--两个列表的最小索引总和

原题链接： https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists/

class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        map<string, int> mp1;
        map<int, vector<string>> mp;
        int n1 = list1.size(), n2 = list2.size();
        for (int i = 0; i < n1; ++i) {
            mp1[list1[i]] = i;
        } 
        for (int i = 0; i < n2; ++i) {
            if (mp1.count(list2[i])) {
                int idx = i + mp1[list2[i]];
                mp[idx].push_back(list2[i]);
            } 
        }
        return mp.begin()->second;
    }
};