利用递归结构算出斐波那契数列第n项
package com.study.wyh;
import java.util.Scanner;
/*
* 利用递归结构算出斐波那契数列第n项
*/
public class FibonacciSequence {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.println(Fibonacci(n));
}
public static int Fibonacci(int n){
if(n == 1) {
return 1;
}else if (n == 2) {
return 1;
}else {
return Fibonacci(n-1)+Fibonacci(n-2);
}
}
}
运行结果: