# C#LeetCode刷题之#599-两个列表的最小索引总和​​​​​​​​​​​​​​（Minimum Index Sum of Two Lists）

[“Shogun”, “Tapioca Express”, “Burger King”, “KFC”]
[“Piatti”, “The Grill at Torrey Pines”, “Hungry Hunter Steakhouse”, “Shogun”]

[“Shogun”, “Tapioca Express”, “Burger King”, “KFC”]
[“KFC”, “Shogun”, “Burger King”]

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.

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

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:

The length of both lists will be in the range of [1, 1000].
The length of strings in both lists will be in the range of [1, 30].
The index is starting from 0 to the list length minus 1.
No duplicates in both lists.

```public class Program {

public static void Main(string[] args) {
var list1 = new string[] { "Shogun", "Tapioca Express", "Burger King", "KFC" };
var list2 = new string[] { "KFC", "Shogun", "Burger King" };

var res = FindRestaurant(list1, list2);
ShowArray(res);

}

private static void ShowArray(string[] array) {
foreach(var interest in array) {
Console.Write(\$"{interest} ");
}
Console.WriteLine();
}

public static string[] FindRestaurant(string[] list1, string[] list2) {
var min = int.MaxValue;
var dic = new Dictionary<string, int>();
for(var i = 0; i < list1.Length; i++) {
for(var j = 0; j < list2.Length; j++) {
if(list1[i] == list2[j]) {
min = Math.Min(min, i + j);
}
}
}
return (from r in dic.ToList()
where r.Value == min
select r.Key).ToArray();
}

}```

`Shogun`

(2)