Scala之递归的两个小练习

1. 求斐波那契数

package com.atguigu.chapter05.fun

import scala.io.StdIn

object Exercise01 {
  def main(args: Array[String]): Unit = {
    // 斐波那契
    println("请输入n的值:")
    val n: Int = StdIn.readInt()
    var res: Int = fabonaqi(n)
    println("res=" + res)
  }

  def fabonaqi(n: Int): Int ={
    if(n == 1 || n == 2) {
      return 1
    }
    return fabonaqi(n - 1) + fabonaqi(n - 2)
  }
}

2. 求函数值

package com.atguigu.chapter05.fun

import scala.io.StdIn

object Exercise02 {
  def main(args: Array[String]): Unit = {
    // 已知f(1)=3;f(n)=2*f(n-1)+1;
    println("请输入n的值:")
    val n: Int = StdIn.readInt()
    val res = getRes(n)
    println("结果为:" + res)
  }

  // 求函数值
  def getRes(n: Int): Int ={
    if(n == 1){
      return 3
    }
    return 2 * getRes(n - 1) + 1
  }
}