扶强 2019-02-25 14:57 采纳率: 100%
浏览 326
已采纳

将以下代码改成递归形式

public void Calc1(int initCount, int avgCount, int endClass)
        {
            List<TreeData> list1 = new List<TreeData>();
            TreeData data1 = new Models.TreeData() { id = 0, name = "推客", parentid = 0, value = 0 };
            List<TreeData> list2 = new List<Models.TreeData>();
            for (int b = 0; b < avgCount; b++)
            {
                TreeData data2 = new Models.TreeData() { id = 0, name = "推客", parentid = 0, value = 0 };
                List<TreeData> list3 = new List<Models.TreeData>();
                for (int c = 0; c < avgCount; c++)
                {
                    TreeData data3 = new Models.TreeData() { id = 0, name = "推客", parentid = 0, value = 0 };

                    list3.Add(data3);
                    data2.children = list3;
                }
                list2.Add(data2);
                data1.children = list2;
            }
            list1.Add(data1);
        }

TreeData 结构如下

 public class TreeData
    {
        public string name { get; set; }

        public int? value { get; set; }

        [JsonIgnore]
        public int? id { get; set; }
        [JsonIgnore]
        public int? parentid { get; set; }

        public List<TreeData> children { get; set; }
    }

最终层级是endClass

  • 写回答

1条回答 默认 最新

  • 起个昵称真费劲 2019-02-25 15:51
    关注
            public void Calc1(int initCount, int avgCount, int endClass)
            {
                List<TreeData> list1 = new List<TreeData>();
                int index = 1;
                for (int i = 0; i < initCount; i++)
                {
                    TreeData data1 = new TreeData() { id = 0, name = "推客", parentid = 0, value = 0, index = index };
                    data1.children = new TreeData().GetTreeData(avgCount, endClass, index);
                    list1.Add(data1);
                }
            }
    
            public class TreeData
            {
                //当前深度
                public int index { get; set; }
    
                public string name { get; set; }
    
                public int? value { get; set; }
    
    
                public int? id { get; set; }
    
                public int? parentid { get; set; }
    
                public List<TreeData> children { get; set; }
    
    
                public List<TreeData> GetTreeData(int avgCount, int endClass, int index)
                {
                    List<TreeData> list = new List<TreeData>();
                    index++;
                    this.index = index;
                    for (int i = 0; i < avgCount; i++)
                    {
                        TreeData data1 = new TreeData() { id = 0, name = "第" + index + "级", parentid = 0, value = 0, index = index };
                        if (this.index != endClass)
                        {
                            data1.children = new TreeData().GetTreeData(avgCount, endClass, index);
                        }
                        list.Add(data1);
                    }
    
                    return list;
                }
            }
    
    
        //调用 - by 没想好
        Calc1(2,3,7);
    
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥15 求差集那个函数有问题,有无佬可以解决
  • ¥15 【提问】基于Invest的水源涵养
  • ¥20 微信网友居然可以通过vx号找到我绑的手机号
  • ¥15 寻一个支付宝扫码远程授权登录的软件助手app
  • ¥15 解riccati方程组
  • ¥15 display:none;样式在嵌套结构中的已设置了display样式的元素上不起作用?
  • ¥15 使用rabbitMQ 消息队列作为url源进行多线程爬取时,总有几个url没有处理的问题。
  • ¥15 Ubuntu在安装序列比对软件STAR时出现报错如何解决
  • ¥50 树莓派安卓APK系统签名
  • ¥65 汇编语言除法溢出问题