599.两个列表的最小索引总和

两天宇宙人

2020-01-23

😂代码实现

class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        vector<string> vec;
        if(!list1.size())
            return vec;
        map<string, int> st1, st2;
        for(int i = 0; i < list1.size(); ++i) 
            st1.insert({list1[i], i});
        for(int i = 0; i < list2.size(); ++i) {
            if(st1.count(list2[i]) != 0) {
                auto x = st1.at(list2[i]);
                st2.insert({list2[i], x + i});
            }
        }
        int mi = INT_MAX;
        for(auto x :st2) {
            if(mi > x.second) {
                mi = x.second;
                // ms = x.first;
            }
        }
        for(auto x : st2) {
            if(mi == x.second) 
                vec.push_back(x.first);
        }
        return vec;
    }   
};