#Leetcode# 599. Minimum Index Sum of Two Lists

https://leetcode.com/problems/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:

1. The length of both lists will be in the range of [1, 1000].
2. The length of strings in both lists will be in the range of [1, 30].
3. The index is starting from 0 to the list length minus 1.
4. No duplicates in both lists.

代码：

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

　　映射字符串与坐标 不断更新维护相同的字符串坐标最小的和 如果出现更小的清空 ans 加入更小的坐标和对应的字符串 之前自己写的先找出来最小和然后再按照坐标和找的办法 RE 没找到为什么 明天再改吧

FHFHFH