【Leetcode】599. Minimum Index Sum of Two Lists（Easy）

1.题目

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).

2.思路

做完这道题心情并不好，感觉自己只会用最笨的方法，循环循环~

3.算法

class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {
        List<String> resList=new ArrayList();
        
        int len1=list1.length;
        int len2=list2.length;
        
        int min=Integer.MAX_VALUE;
        for(int i=0;i<len1;i++){
            for(int j=0;j<len2;j++){
                if(list1[i].equals(list2[j])){
                    if(i+j==min){
                        resList.add(list1[i]);
                    }else if(i+j<min){
                        min=i+j;
                        resList.clear();
                        resList.add(list1[i]);
                    }
                }
            }
        }
        String[] array=new String[resList.size()];
        String[] res= resList.toArray(array);
        return res;
    }
}

4.总结

看了solution里面的方法，有一个方案比我的好一些。先把list1的索引都存起来，等到单独循环list2时，如果list2的索引值自己就已经超出了min，就没必要继续了。

另外两个字符串相等，是a.equals(b) 而不是a==b。