首页 > 代码库 > 599. 列表下标最小和 Minimum Index Sum of Two Lists

599. 列表下标最小和 Minimum Index Sum of Two Lists

2024-10-01 02:25:01   217人阅读

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.


  1. public class Solution {
  2.     public string[] FindRestaurant(string[] list1, string[] list2) {
  3.         
  4.         List<Pair> listPair1 = new List<Pair>();
  5.         
  6.         for(int i = 0;i<list1.Length;i++)
  7.         {
  8.             Pair pair =new Pair(list1[i], i);
  9.             listPair1.Add(pair);
  10.         }
  11.         
  12.         
  13.         List<string> lowestMatchList = new List<string>();
  14.         int lowestMatchIndex = Int32.MaxValue;
  15.         for(int i = 0;i<list2.Length;i++)
  16.         {
  17.             foreach(Pair pair in listPair1)
  18.             {
  19.                 string restaurant = list2[i];
  20.                 if(restaurant== pair.Restaurant)
  21.                 {
  22.                     int sum = i + pair.Index;
  23.                     
  24.                     if(sum == lowestMatchIndex)
  25.                     {
  26.                         
  27.                         lowestMatchList.Add(restaurant);
  28.                     }
  29.                     else if(sum < lowestMatchIndex)
  30.                     {
  31.                         lowestMatchIndex = sum;
  32.                         if(lowestMatchList.Count > 0)
  33.                         {
  34.                             lowestMatchList.Remove(lowestMatchList[0]);
  35.                         }
  36.                         lowestMatchList.Add(restaurant);
  37.                     }
  38.                 }
  39.             }
  40.         }
  41.         return lowestMatchList.ToArray();
  42.         
  43.     }
  44.     
  45.     public class Pair
  46.     {
  47.         public string Restaurant {get;set;}
  48.         public int Index {get;set;}
  49.         public Pair(string restaurant, int index)
  50.         {
  51.             Restaurant = restaurant;
  52.             Index = index;
  53.         }
  54.     }
  55. }




null


599. 列表下标最小和 Minimum Index Sum of Two Lists


联系
我们