不用递归来查找父子关系

 static void Main(string[] args)
        {

            Employee e5 = new Employee();
            e5.salary = 1;
            e5.EmployeeCollection = new Employee[1] { null };//注意这里的Employee类型空数组,不要写成e5.EmployeeCollection=null,否则算法有问题

            Employee e55 = new Employee();
            e55.salary = 2;
            e55.EmployeeCollection = new Employee[1] { null };

            Employee e4 = new Employee();
            e4.salary = 2;
            e4.EmployeeCollection = new Employee[2] { e5, e55 };


            Employee e3 = new Employee();
            e3.salary = 3;
            e3.EmployeeCollection = new Employee[1] { e4 };

            Employee e2 = new Employee();
            e2.salary = 4;
            e2.EmployeeCollection = new Employee[1] { e3 };

            //Employee e10 = new Employee();
            //e10.salary = 10;
            //e10.EmployeeCollection = new Employee[1] { null };


            Employee e1 = new Employee();
            e1.salary = 5;
            e1.EmployeeCollection = new Employee[1] { e2 };
            Console.WriteLine("工资总和:" + Employee.Salary(e3));
            Console.Read();
        }
    }


    class Employee
    {
        private int _salary;
        public int salary
        {
            get { return _salary; }
            set { _salary = value; }
        }
        public Employee[] EmployeeCollection;
        public static decimal Salary(Employee e)
        {
            decimal s = e.salary;
            List<Employee> allPeople = new List<Employee>(e.EmployeeCollection);
            for (int i = 0; i < allPeople.Count; i++)
            {

                if (allPeople[i] != null)
                {
                    allPeople.AddRange(allPeople[i].EmployeeCollection);
                    s += allPeople[i].salary;
                }
                //else
                //{
                //    return s;
                //}      
            }
            return s;
        }
    }

  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值