- #线性递归求解【a,b】所有元素和
- int linear_recursion_sum(int a, int b){
- if(a > b)
- return 0;
- else
- return a + linear_recursion_sum(a+1, b);
- }
- #尾递归求解【a,b】所有元素和
- int tail_recursion_sum(int a, int b, int result){
- if(a >b)
- return result;
- else
- return tail_recursion_sum(a+1, b, a+result);
- }
- //该片段来自于http://www.codesnippet.cn/detail/090720149914.html
来源: http://www.codesnippet.cn/detail/090720149914.html