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.

Example 1:

Input:
["Shogun", "Tapioca Express", "Burger King", "KFC"]
["Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"]
Output: ["Shogun"]
Explanation: The only restaurant they both like is "Shogun".

Example 2:

Input:
["Shogun", "Tapioca Express", "Burger King", "KFC"]
["KFC", "Shogun", "Burger King"]
Output: ["Shogun"]
Explanation: The restaurant they both like and have the least index sum is "Shogun" with index sum 1 (0+1).

Note:

1. The length of both lists will be in the range of [1, 1000].
2. The length of strings in both lists will be in the range of [1, 30].
3. The index is starting from 0 to the list length minus 1.
4. No duplicates in both lists.

题意：提供两个数组，判断两个数组中是否有相同组成部分，取二者下标相加最小的，如果有多个最小下标，则都取

思路：一看到数组，第一个想法就是遍历，然后看到判断相同，于是更肯定要用遍历了，值得注意的是，这里不可以用list.toArray的方法将列表转成数组，因为toArray()的方法返回的是Object[]，而不是String[]

class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {
        int min = Integer.MAX_VALUE; 
                List<String> result = new ArrayList<String>();
       for(int i=0;i<list1.length;i++){
           for(int j=0;j<list2.length;j++){
               if(list1[i].equals(list2[j])){
                   int sum = i+j;
                   if(min>=sum){
                       min = sum;
                       result.add(list1[i]);
                   }
               }
           }
       }
            String temp[] =new String[result.size()];
       for(int i=0;i<result.size();i++){
                temp[i]=result.get(i);
            }
        return temp;
    }
}