码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode599

时间:2017-06-01 10:29:37      阅读:106      评论:0      收藏:0      [点我收藏+]

标签:list   desc   com   i++   int   des   key   select   contain   

public class Solution {
    public string[] FindRestaurant(string[] list1, string[] list2) {
        var dic = new Dictionary<string, int>();
            for (int i = 0; i < list1.Length; i++)
            {
                for (int j = 0; j < list2.Length; j++)
                {
                    if (list1[i] == list2[j])
                    {
                        var restaurant = list1[i];
                        var index = i + j;
                        if (!dic.ContainsKey(restaurant))
                        {
                            dic.Add(restaurant, index);
                        }
                    }
                }
            }

            var minIndex = dic.Min(x => x.Value);
            var list = dic.Where(x => x.Value == minIndex).Select(x => x.Key).ToList();
            return list.ToArray();
    }
}

https://leetcode.com/problems/minimum-index-sum-of-two-lists/#/description

leetcode599

标签:list   desc   com   i++   int   des   key   select   contain   

原文地址:http://www.cnblogs.com/asenyang/p/6927115.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!