简单方法去理解递归

1递增5次,用递归的方式实现

response.write(sum(0,1));

protected int sum(int t, int value)
    {
        int h;       
        for (h = t; h < 5; )
        {
            h++;
            value++;           
            sum(h, value);
        }
        return value;
    }

原文地址:https://www.cnblogs.com/ajun/p/2784429.html