11 2012 档案

摘要: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; } 阅读全文
posted @ 2012-11-23 14:32 ajunfly 阅读(199) 评论(0) 推荐(0)