leetcde599+求出现相同单词的索sum最小，map进行hash

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82431452

https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/

class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        vector<string> res;
        map<string, int> m;
        int mn = INT_MAX, n1 = list1.size(), n2 = list2.size();
        for(int i=0; i<n1; i++) m[list1[i]] = i;
        for(int i=0; i<n2; i++){
            if(m.count(list2[i])){
                int sum =  i+m[list2[i]];
                if(sum==mn) res.push_back(list2[i]);
                else if(sum<mn){
                    mn = sum;
                    res.clear();
                    res.push_back(list2[i]);
                }
            }
        }
        return res;
    }
};