【Question & Answer】Functional Programming in Scala

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

1. Functional Programming in Scala
   
2. 
   
3. This book is written to document the solutions attempted to solve the exercises in the book

复制代码

本帖隐藏的内容

Functional Programming in Scala.pdf (380.78 KB, 需要: 1 个论坛币)

2017-2-21 10:35:54 上传

需要: 1 个论坛币  [购买]

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：Programming Functional function question Program exercises document written

1. 2.1
   
2. 
   
3. Write a recursive function to get the nth Fibonacci number (http://mng.bz/C29s). The first two Fibonacci numbers are 0 and 1. The nth number is always the sum of the previous two—the sequence begins 0, 1, 1, 2, 3, 5. Your definition should use a local tail-recursive function. def fib(n: Int): Int
   
4. Solution
   
5. 
   
6. def fib(n: Int): Int = {
   
7.     def go(n: Int, first: Int, second: Int): Int =
   
8.       if(n == 1) first
   
9.       else if (n == 2) second
   
10.       else go(n-1, second, first + second)
    
11.     go(n, 0, 1)
    
12.   }

复制代码

1. 2.2
   
2. 
   
3. Implement isSorted, which checks whether an Array[A] is sorted according to a given comparison function: def isSortedA => Boolean): Boolean
   
4. Solution
   
5. 
   
6. def isSorted[A](as: Array[A], ordered: (A, A) => Boolean): Boolean = {
   
7.     @annotation.tailrec
   
8.     def go(n: Int): Boolean =
   
9.       if (n == as.length - 1) ordered(as(n-1), as(n))
   
10.       else if (! ordered(as(n-1), as(n))) false
    
11.       else go(n + 1)
    
12.     if (as.size == 0 || as.size == 1) true
    
13.     else go(1)
    
14.   }

复制代码

谢谢分享

743旅行社运行与管理6版2429-2PPT梁智

谢谢楼主