首页 > itarticle > [leetcode] problem 599 – minimum index sum of two lists

[leetcode] problem 599 – minimum index sum of two lists

admin 11月 13, 2020 0

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

No.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”.

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

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 
public String[] findRestaurant(String[] list1, String[] list2) {
    List<String> result = new ArrayList<>();
    Map<String, Integer> map = new HashMap<>();
    int min = 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]))
            continue;

        int sum = i + map.get(list2[i]);

        if (sum < min) {
            min = sum;
            result.clear();
        }

        if (sum <= min)
            result.add(list2[i]);
    }

    return result.toArray(new String[result.size()]);
}
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能