zoukankan      html  css  js  c++  java
  • Dictionary排序

    public Dictionary<string, int[]> GetWebVisitedTopInfo(Dictionary<string, int[]> websiteVisitInfo, int topCount)
    {
    Dictionary<string, int[]> websiteTopinfo = new Dictionary<string, int[]>();
    List<KeyValuePair<string, int[]>> list = sortByValue(websiteVisitInfo);
    int minNub = topCount < websiteVisitInfo.Count ? topCount : websiteVisitInfo.Count;
    for (int i = 0; i < minNub; i++)
    {
    websiteTopinfo.Add(list[i].Key, list[i].Value);
    }
    return websiteTopinfo;
    }

    /// <summary>
    /// 排序列表
    /// </summary>
    /// <param name="dict"></param>
    /// <returns></returns>
    public static List<KeyValuePair<string, int[]>> sortByValue(Dictionary<string, int[]> dict)
    {
    List<KeyValuePair<string, int[]>> list
    = new List<KeyValuePair<string, int[]>>(dict);
    list.Sort(
    delegate(KeyValuePair<string, int[]> kvp1, KeyValuePair<string, int[]> kvp2)
    {
    return kvp2.Value[0] - kvp1.Value[0];
    });
    return list;
    }

  • 相关阅读:
    BZOJ3391: [Usaco2004 Dec]Tree Cutting网络破坏
    python总结二
    python总结一
    评论详解
    C++入门篇十三
    C++入门篇十二
    C++入门篇十一
    C++入门篇十
    C++入门篇九
    c++入门篇八
  • 原文地址:https://www.cnblogs.com/GreenGrass/p/2681961.html
Copyright © 2011-2022 走看看