【LeetCode】599.Minimum Index Sum of Two Lists(Easy)解题报告

【LeetCode】599.Minimum Index Sum of Two Lists(Easy)解题报告

题目地址：https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/
题目描述：

  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".
>  Note:

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.

  可以用两个hashmap，一个map存key是餐馆名，value为index和，但是复杂度更高。不如用stack。

Solution:

class Solution {
    public String[] findRestaurant(String[] list1, String[] list2) {

        Map<String , Integer> map= new HashMap<>();
        //装最小下标餐馆的名字
        Stack<String> stack = new Stack<>();
        int minIndex = Integer.MAX_VALUE;
        for(int i=0; i<list1.length;i++){
            map.put(list1[i],i);
        }
        for(int i=0;i<list2.length;i++){
            if(map.containsKey(list2[i])){
                if(map.get(list2[i])+i<minIndex){
                    minIndex = map.get(list2[i]) + i;
                    stack.clear();
                    stack.push(list2[i]);
                }else if(map.get(list2[i]) + i == minIndex){
                    stack.push(list2[i]);
                }
            }
        }
        String[] res = new String[stack.size()];
        for(int i=0 ; i<res.length ; i++){
            res[i]=stack.pop();
        }
        return res;

    }
}

Date：2017年11月22日