leetcode599. 两个列表的最小索引总和(java & python3)

 java:

class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {
        Map<String, Integer> map = new HashMap<>();
        for(int i = 0; i < list1.length; i++){
            map.put(list1[i], i);
        }

        List<String> ans = new ArrayList<>();
        int mid = Integer.MAX_VALUE;
        for(int i = 0; i < list2.length; i++){
            if(map.containsKey(list2[i])){
                int j = map.get(list2[i]);
                if(i + j < mid){
                    ans.clear();
                    ans.add(list2[i]);
                    mid = i + j;
                }else if(i + j == mid){
                    ans.add(list2[i]);
                }
            }
        }

        return ans.toArray(new String[ans.size()]);
    }
}

python3:

class Solution:
    def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]:
        dic = {s : i for i, s in enumerate(list1)}
        ans = []
        mid = inf
        for i, s in enumerate(list2):
            if s in dic:
                j = dic[s]
                if i + j < mid:
                    mid = i + j
                    ans = [s]
                elif i + j == mid:
                    ans.append(s)
        return ans