摘要:
(1) 递归计算5!public int getFactorial(int num){ if(num==1){ return num; }else{ return num*getFactorial(num-1); ... 阅读全文
posted @ 2015-03-10 14:37
Juniors
阅读(118)
评论(0)
推荐(0)
|
摘要:
(1) 递归计算5!public int getFactorial(int num){ if(num==1){ return num; }else{ return num*getFactorial(num-1); ... 阅读全文
posted @ 2015-03-10 14:37
Juniors
阅读(118)
评论(0)
推荐(0)
|