哈希表-两个列表的最小索引总和

输入:
["Shogun", "Tapioca Express", "Burger King", "KFC"]
["KFC", "Shogun", "Burger King"]
输出: ["Shogun"]
解释: 他们共同喜爱且具有最小索引和的餐厅是“Shogun”，它有最小的索引和1(0+1)。

class Solution:
    def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]:
        #m = {i: list1.index(i)+list2.index(i) for i in list1 if i in list2}     # 生成重合字典
        #min_v = min(v for v in m.values())                                      # 找出字典最小值
        #return [x[0] for x in m.items() if x[1]== min_v]                        # 生成链表
        
        m = {i: list1.index(i)+list2.index(i) for i in list1 if i in list2}
        min_v = min(m.values())
        return [x[0] for x in m.items() if x[1]== min_v]