[LeetCode]599.Minimum Index Sum of Two List

题目大意：点击打开链接

思路：找intersection的部分，思路来自于Intersection of Two Arrays：点击打开链接

public 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> list=new ArrayList<>();        int indexSum=0;        int minSum=Integer.MAX_VALUE;        for(int i=0;i<list2.length;i++){            if(map.containsKey(list2[i])){                indexSum=map.get(list2[i])+i;                if(indexSum<minSum){                    minSum=indexSum;                    list.clear();                      //每次有更小的minSum，更新minSum的时候，都要清空list                    list.add(list2[i]);                }else if(indexSum==minSum){            //相同的minSum直接添加                    list.add(list2[i]);                }            }        }                String[] result=new String[list.size()];        for(int i=0;i<result.length;i++){            result[i]=list.get(i);        }        return result;                                //或者return list.toArray(new String[list.size()]);    }}