leetcode748

public class Solution
    {
        public string ShortestCompletingWord(string licensePlate, string[] words)
        {
            var list = words.OrderBy(x => x.Length);
            var pattern = licensePlate.ToLower();
            var dic = new Dictionary<char, int>();
            foreach (var p in pattern)
            {
                if (p >=  && p <= )
                {
                    if (!dic.ContainsKey(p))
                    {
                        dic.Add(p, );
                    }
                    else
                    {
                        dic[p]++;
                    }
                }
            }

            foreach (var word in list)
            {
                bool find = true;
                var dic2 = new Dictionary<char, int>();
                foreach (var p in word)
                {
                    if (!dic2.ContainsKey(p))
                    {
                        dic2.Add(p, );
                    }
                    else
                    {
                        dic2[p]++;
                    }
                }

                foreach (var d in dic)
                {
                    if (!dic2.ContainsKey(d.Key) || dic2[d.Key] < dic[d.Key])
                    {
                        find = false;
                        break;
                    }
                }
                if (find)
                {
                    return word;
                }
            }

            return "";
        }
    }