leetcode::minimum_index_sum_of_two_lists::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static vector< string >	findRestaurant (vector< string > &list1, vector< string > &list2)

详细描述

在文件 leetcode.h 第 1731 行定义.

成员函数说明

findRestaurant()

vector< string > leetcode::minimum_index_sum_of_two_lists::Solution::findRestaurant ( vector< string > &  list1, vector< string > &  list2  )

static

在文件 leetcode.cpp 第 4506 行定义.

                                                                                            {
            unordered_map<string, int> restaurants;
            unordered_map<string, int> index1;
            unordered_map<string, int> index2;
            for(int i = 0; i < list1.size(); i++) {
                restaurants[list1[i]]++;
                index1[list1[i]] = i;
            }
            for(int i = 0; i < list2.size(); i++) {
                restaurants[list2[i]]++;
                index2[list2[i]] = i;
            }
            unordered_set<string> optional_restaurants;
            for(auto [restaurant, count]: restaurants) {
                if(count > 1) {
                    optional_restaurants.insert(restaurant);
                }
            }
            int min_index_sum = INT_MAX;
            for(const auto &optional_restaurant: optional_restaurants) {
                int index_sum = index1[optional_restaurant] + index2[optional_restaurant];
                min_index_sum = min(min_index_sum, index_sum);
            }
            vector<string> ans;
            for(const auto &optional_restaurant: optional_restaurants) {
                int index_sum = index1[optional_restaurant] + index2[optional_restaurant];
                if(index_sum == min_index_sum) {
                    ans.push_back(optional_restaurant);
                }
            }
            return ans;
        }

被这些函数引用 leetcode::minimum_index_sum_of_two_lists::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp