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.

public class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {
        int sum=Integer.MAX_VALUE;
        List<String> a=new ArrayList<>();

        for(int i=0;i<list1.length;i++)
            for(int j=0;j<list2.length;j++)
            {
                if(list1[i].length()==list2[j].length()&&list1[i].equals(list2[j]))
                {
                    if(sum>i+j){
                        a.clear();
                        a.add(list1[i]);
                        sum=i+j;
                    }  
                    else if(sum==i+j)
                    {
                        a.add(list1[i]);
                    }
                }
            }
        
        return a.toArray(new String[a.size()]);
    }
}

 除此之外还可以使用hashmap将算法运算时间复杂度降下来

改进如下：

public class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {
        int sum=Integer.MAX_VALUE;
        List<String> a=new ArrayList<>();
        Map<String,Integer> m=new HashMap<>();
        for(int i=0;i<list1.length;i++)
            {m.put(list1[i],i);}
        for(int i=0;i<list2.length;i++)
        {
            if(m.containsKey(list2[i]))
            {
                int j=m.get(list2[i]);
                if(sum>j+i){
                    a.clear();
                    a.add(list2[i]);
                    sum=i+j;
                }
                else if(sum==i+j)
                    {
                        a.add(list2[i]);
                    }
            }
        }

        return a.toArray(new String[a.size()]);
    }
}