LeetCode 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:

1. The length of both lists will be in the range of [1, 1000].
2. The length of strings in both lists will be in the range of [1, 30].
3. The index is starting from 0 to the list length minus 1.
4. No duplicates in both lists.

题目链接

题意是：给两个字符串的列表，要求找出这两个列表中序号和最小的公共项，假如有多个答案，就全部输出。

解决思路就是挨个找，枚举list1中的每一个，假如list2中也有，就和当前最小序的和比较，若更小，就清空答案列表，更新最小序的和，若相等，就把这个字符串也加入到要返回的答案中，没用优化，居然给过了。。。

代码 python2.7 版本：

class Solution(object):    def findRestaurant(self, list1, list2):        min = 9999999        ans = []        for str in list1:            if str in list2:                if list1.index(str) + list2.index(str) < min:                    min = list1.index(str) + list2.index(str)                    ans = []                    ans.append(str)                elif list1.index(str) + list2.index(str) == min:                    ans.append(str)        return ans