599. Minimum Index Sum of Two Lists

Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings.

You need to help them find out their common interest with the least list index sum. If there is a choice tie between answers, output all of them with no order requirement. You could assume there always exists an answer.

Example 1:
Input:
["Shogun", "Tapioca Express", "Burger King", "KFC"]
["Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"]
Output: ["Shogun"]
Explanation: The only restaurant they both like is "Shogun".
Example 2:
Input:
["Shogun", "Tapioca Express", "Burger King", "KFC"]
["KFC", "Shogun", "Burger King"]
Output: ["Shogun"]

Explanation: The restaurant they both like and have the least index sum is “Shogun” with index sum 1 (0+1).
Note:
The length of both lists will be in the range of [1, 1000].
The length of strings in both lists will be in the range of [1, 30].
The index is starting from 0 to the list length minus 1.
No duplicates in both lists.

思路：
本题就是在两个字符串数组中寻找相同的串，然后将下标相加，找到最小的。运用map<string，int>。
要注意的是
map中的values 不是出现的次数，而是下标，便于比较大小。
code:

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