599. 两个列表的最小索引总和

class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {
         Map<String,Integer> map = new HashMap<String,Integer>();
         for(int i = 0;i<list2.length;i++){
             map.put(list2[i],i);
         }
         int[] flag = new int[list1.length];
         Arrays.fill(flag,-1);
         int minIndex = Integer.MAX_VALUE;
         for(int i = 0;i<list1.length;i++){
             if(map.containsKey(list1[i])){
                 minIndex = Math.min(minIndex,i+map.get(list1[i]));
                 flag[i] = i+map.get(list1[i]);
             }
         }
         List<String> res = new ArrayList<String>();
         for(int i = 0;i<flag.length;i++){
             if(flag[i]==minIndex){
                 res.add(list1[i]);
             }
         }
    return res.toArray(new String[res.size()]);
    }
}