zoukankan      html  css  js  c++  java
  • C#递归计算树形菜单 小小西

    1 先获取1级菜单集合

    /// <summary>
    /// 获取菜单列表
    /// </summary>
    /// <returns></returns>
    public List<MenuInfo> GetMenuList()
    {
    List<MenuInfo> departments = new List<MenuExt>();
    List<MenuInfoExt> menuinfoses =
    _menuinfoRepository.Queryable().OrderBy("MenuId").Select(p => new MenuInfoExt()
    {
    ParentMenuId=p.ParentMenuId,
    MenuId = p.MenuId,
    Name = p.Name
    }).ToList();
    foreach (var item in menuinfoses)
    {
    if (item.ParentMenuId == 0)
    {
    MenuInfodepartment = new MenuInfo();
    department.id = item.MenuId;
    department.text = item.Name;
    department.children = AddChildNode(menuinfoses, item.MenuId);
    departments.Add(department);
    }

    }
    return departments;

    }

    private List<MenuInfo> AddChildNode(List<MenuInfoExt> list, long departmentId)
    {
    List<MenuInfo> departments = new List<MenuInfo>();

    foreach (var item in list.Where(p => p.ParentMenuId == departmentId))
    {
    MenuInfodepartment = new MenuInfo();
    department.id = item.MenuId;
    department.text = item.Name;
    department.children = AddChildNode(list, item.MenuId);
    departments.Add(department);
    }
    return departments;
    }

  • 相关阅读:
    逆序数———线段树/树状数组
    线段树 模板
    博弈论--对称博弈
    matlab程序设计
    matlab矩阵的操作
    2nd 历年学生作品评论(3部)
    1st 四人小组项目
    1st 本周工作量及进度统计
    1st 结对编程:简易四则运算
    1st 英文文章词频统计
  • 原文地址:https://www.cnblogs.com/dyc-zlj/p/10668283.html
Copyright © 2011-2022 走看看