Minimum Index Sum of Two Lists
Question
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.
Tags
- Hashmap
Thought
Use the hash map to store the restaurant name and the corresponding index in the list. Then, compare the sum of the index in the common names set.
Code
class Solution(object):
def findRestaurant(self, list1, list2):
"""
:type list1: List[str]
:type list2: List[str]
:rtype: List[str]
"""
dict1, dict2 = dict(), dict()
for i, name in enumerate(list1):
dict1[name] = i
set1 = set(dict1.keys())
for i, name in enumerate(list2):
dict2[name] = i
set2 = set(dict2.keys())
commenSet = set1 & set2
minIndex = float('inf')
minName = []
for name in commenSet:
if dict1[name] + dict2[name] < minIndex:
minName = [name]
minIndex = dict1[name] + dict2[name]
elif dict1[name] + dict2[name] == minIndex:
minName.append(name)
else:
continue
return minName