# LeetCode - 0599. Minimum Index Sum of Two Lists
### 題目網址：https://leetcode.com/problems/minimum-index-sum-of-two-lists/
###### tags: `LeetCode` `Easy`

/*
    -LeetCode format-
    Problem: 599. Minimum Index Sum of Two Lists
    Difficulty: Easy
    
    by Inversionpeter
*/



class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        map <string, int> indices;
        for (int i = 0; i != list1.size(); ++i) 
            indices[list1[i]] = i;
        vector <string> answers;
        int least = 81000, sums;
        for (int i = 0; i < list2.size(); ++i)
            if (indices.find(list2[i]) != indices.end()) {
                sums = indices[list2[i]] + i;
                if (sums < least) {
                    least = sums;
                    answers.clear(); answers.push_back(list2[i]);
                }
                else if (sums == least)
                    answers.push_back(list2[i]);
            }
        return answers;
    }
};