Package g0501_0600.s0599_minimum_index_sum_of_two_lists

Class Solution

java.lang.Object

g0501_0600.s0599_minimum_index_sum_of_two_lists.Solution

public class Solution
extends Object

599 - Minimum Index Sum of Two Lists\. Easy 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:** list1 = ["Shogun","Tapioca Express","Burger King","KFC"], list2 = ["Piatti","The Grill at Torrey Pines","Hungry Hunter Steakhouse","Shogun"] **Output:** ["Shogun"] **Explanation:** The only restaurant they both like is "Shogun". **Example 2:** **Input:** list1 = ["Shogun","Tapioca Express","Burger King","KFC"], list2 = ["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). **Constraints:** * `1 <= list1.length, list2.length <= 1000` * `1 <= list1[i].length, list2[i].length <= 30` * `list1[i]` and `list2[i]` consist of spaces `' '` and English letters. * All the stings of `list1` are **unique**. * All the stings of `list2` are **unique**.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
void	fillMap(String[] a, Map<String,Integer> hm)
String[]	findRestaurant(String[] list1, String[] list2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findRestaurant

public String[] findRestaurant(String[] list1,
 String[] list2)

fillMap

public void fillMap(String[] a,
 Map<String,Integer> hm)