LeetCode 599. Minimum Index Sum of Two Lists(map,unordered_map)

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.

思路：

使用vector的it=find(list.begin(),list.end(),str)函数找出共同出现的字符串，并用distanc(list.begin(),it)函数找到索引值，简历共同字符串和索引和的hash表，循环过程中找出最小索引和。最后遍历共同字符串hash表，找出索引和等于最小索引和的那些字符串，返回。

Code：

class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        map<string,int> comResM;
        vector<string> comRes;
        vector<string> :: iterator it;
        int l1,l2;
        int sum=list1.size()+list2.size();
        for(int i=0;i<list1.size();i++){
            it = find(list2.begin(),list2.end(),list1[i]);
            if(it!=list2.end()){
                l1=i;
                l2=distance(list2.begin(),it);
                comResM[list1[i]] = l1+l2;
                if((l1+l2)<sum) sum=l1+l2;
            }
        }
        for(auto & n:comResM){
            if(n.second==sum) comRes.push_back(n.first);
        }
        return comRes;
    }
};

为了不重新遍历hash表，可以建立unordered_map<int, vector<string>>，存放<索引和，对应的共同字符串数组>。代码如下：

Code:

class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        unordered_map<string, int> hash1;
        for (int i = 0; i < list1.size(); i++) {
            hash1[list1[i]] = i;
        }
        unordered_map<int, vector<string> > ans;
        int min = list1.size()+list2.size();
        for (int j = 0; j < list2.size(); j++) {
            auto got = hash1.find(list2[j]);
            if (got != hash1.end()) {
                int common = got->second + j;
                if (common <= min) {
                    min = common;
                    ans[min].push_back(list2[j]);
                }
            }
        }
        return ans[min];
    }
};