zoukankan      html  css  js  c++  java
  • Dictionary学习笔记嵌套Dictionary的遍历与排序(按Key值)(二)

    class Program
        {
            static void Main()
            {
               
                //构造一个嵌套字典
                Dictionary<int, Dictionary<int, string>> dicExternal = new Dictionary<int, Dictionary<int, string>>();
                for (int i = 90; i > 65; i = i - 5)
                {
                    Dictionary<int, string> dicInternal = new Dictionary<int, string>();
                    for (int j = i; j > i - 5; j--)
                    {
                        char asc = (char)j;
                        dicInternal.Add(j, asc.ToString());
                    }
                    dicExternal.Add(i, dicInternal);
                }
                //内层字典排序
                Dictionary<int, Dictionary<int, string>> T = new Dictionary<int, Dictionary<int, string>>();
                foreach (int key in dicExternal.Keys)
                {
                    Dictionary<int, string> dicOrderInter = new Dictionary<int, string>();
                    dicOrderInter = (from p in dicExternal[key] orderby p.Key select p).ToDictionary(pair => pair.Key, pair => pair.Value);
                    T.Add(key, dicOrderInter);
                }
                //外层字典排序
                Dictionary<int, Dictionary<int, string>> dicOrderExter = new Dictionary<int, Dictionary<int, string>>();
                dicOrderExter = (from p in T orderby p.Key select p).ToDictionary(pair => pair.Key, pair => pair.Value);

                //输出排序后的所有内层字典的Value
                foreach (int key in dicOrderExter.Keys)
                {
                    foreach (int keyInter in dicOrderExter[key].Keys)
                    {
                        Console.WriteLine("key:" + keyInter + ",Value:" + dicOrderExter[key][keyInter].ToString());
                    }
                }
                Console.ReadLine();
               
            }
        }

    运行结果:

  • 相关阅读:
    poj 3277 City Horizon (线段树 扫描线 矩形面积并)
    HDU 1255 覆盖的面积 (扫描线 线段树 离散化 矩形面积并)
    Codeforces Round #260 (Div. 2)
    poj 1151 Atlantis (离散化 + 扫描线 + 线段树 矩形面积并)
    CF1237F Balanced Domino Placements
    CF954H Path Counting
    AT2395 [ARC071C] TrBBnsformBBtion
    AT2400 [ARC072B] Alice&Brown
    AT2401 [ARC072C] Alice in linear land
    [国家集训队]阿狸和桃子的游戏
  • 原文地址:https://www.cnblogs.com/wangchao928/p/2508473.html
Copyright © 2011-2022 走看看