[LeetCode&Python] Problem 599. Minimum Index Sum of Two Lists-优快云博客

本文介绍了一个帮助两个人基于各自的餐厅喜好列表，找到共同喜欢且列表索引和最小的餐厅的算法。通过遍历两个列表并比较索引和，可以找出最优解。示例展示了当存在多个最优解时，算法会返回所有符合条件的餐厅。

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.

class Solution(object):
    def findRestaurant(self, list1, list2):
        """
        :type list1: List[str]
        :type list2: List[str]
        :rtype: List[str]
        """
        ans=[]
        ma=100000
        n=len(list1)
        for i in range(n):
            s=list1[i]
            if s in list2:
                j=list2.index(s)
                if i+j<=ma:
                    ma=i+j
                    ans.append(s)
        return ans

转载于:https://www.cnblogs.com/chiyeung/p/10080474.html