网站介绍:以 f(a) a=1,2,3…n求和为例。 1. 线性递归def sumFactorials(f:Int=>Int,a:Int,b:Int):Int={ if (a >b) 0 else f(a) + sumFactorials(f,a+1,b) }2.尾递归 def sumFacorials(f:Int=>Int,a:Int,b:Int):Int={ def loo_def sum(f: int => int, a: int, b: int):int ={ if(a > b) 0 else f(a) + su
- 链接地址:https://blog.csdn.net/sadfasdgaaaasdfa/article/details/50880022
- 链接标题:scala中的递归和currying_def sum(f: int => int, a: int, b: int):int ={ if(a-CSDN博客
- 所属网站:blog.csdn.net
- 被收藏次数:3295
- 网站标签:def sum(f: int => int a: int b: int):int ={ if(a > b) 0 else f(a) + su