-
Notifications
You must be signed in to change notification settings - Fork 0
/
Minimum Index Sum of Two Lists
59 lines (55 loc) · 2.01 KB
/
Minimum Index Sum of Two Lists
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/*
LeetCode 599:
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.
Solution:
Language: C++
Tag: hashmap
*/
class Solution {
public:
#define min(a, b) (a < b ? a : b)
vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
if (list1.empty() || list2.empty()) {
return vector<string>();
}
// 1. O(size1 + size2) time + O() space
vector<string> res;
unordered_map<string, int> hash;
for (int i = 0; i < list1.size(); ++i) {
hash[list1[i]] = i;
}
unordered_map<string, int> hash1;
int min_sum = INT_MAX;
for (int i = 0; i < list2.size(); ++i) {
if (hash.find(list2[i]) != hash.end()) {
int sum = i + hash[list2[i]];
hash1[list2[i]] = sum;
min_sum = min(min_sum, sum);
}
}
for (pair<string, int> item : hash1) {
if (item.second == min_sum) {
res.push_back(item.first);
}
}
return res;
}
};