599. Minimum Index Sum of Two Lists

最新推荐文章于 2024-09-23 11:27:55 发布

Snail_Walker

最新推荐文章于 2024-09-23 11:27:55 发布

阅读量338

点赞数

分类专栏： Leetcode 文章标签： 599 leetcode C++

本文链接：https://blog.csdn.net/c602273091/article/details/73302469

版权

Leetcode 专栏收录该内容

175 篇文章 0 订阅

订阅专栏

599. Minimum Index Sum of Two Lists

description

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.

implementation

class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
        int size1 = list1.size();
        int size2 = list2.size();

        vector<string> res;

        map<string, int> mmp;

        for(int idx = 0; idx < size1; idx++) {
            mmp[list1[idx]] = idx*(-1) - 1;
        }

        int min_sum = INT_MAX;
        for(int idx = 0; idx < size2; idx++) {
            if(mmp[list2[idx]] < 0) {
                int s = -1*mmp[list2[idx]] + idx;
                mmp[list2[idx]] = s;
                if(s < min_sum) {
                    min_sum = s;
                }
            }    
        }

        if(size1 > size2) {
            for(int idx = 0; idx < size2; idx++) {
                if(mmp[list2[idx]] == min_sum) 
                    res.push_back(list2[idx]);
            }    
        }
        else {
            for(int idx = 0; idx < size1; idx++) {
                if(mmp[list1[idx]] == min_sum)
                    res.push_back(list1[idx]);
            }    
        }

        return res;
    }
};