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.

思路一：

时间复杂度O(N+M)，空间复杂度O(N)

class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {
        HashMap<String, Integer> map = new HashMap<>();
        List<String> list = new LinkedList<>();
        int min = Integer.MAX_VALUE;

        for (int i = 0; i < list1.length; i++)
            map.put(list1[i], i);
        for (int i = 0; i < list2.length; i++)
        {
            Integer j = map.get(list2[i]);
            if (j != null && i + j <= min)
            {
                if (i + j < min)
                {
                    list.clear();
                    min = i + j;
                }
                list.add(list2[i]);
            }
        }
        return list.toArray(new String[list.size()]);
    }
}