上海交通大学 Fibonacci(java)

题目描述
    The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55...} are defined by the recurrence:     F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2     Write a program to calculate the Fibonacci Numbers.
输入描述:
    Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。
输出描述:
   For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.
示例1
输入
复制
1
输出
复制
1

import java.io.*;
import java.util.*;
public class Main
{
    public static void main(String[] args){
    	try {
	        BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
	        int n = Integer.parseInt(br.readLine());
	        System.out.println(fibonacci(n));
	    } catch (IOException e) {
	        e.printStackTrace();
	    }
    }
    public static int fibonacci(int n) {
    	if(n == 0) return 0;
    	if(n == 1) return 1;
    	return fibonacci(n-1) + fibonacci(n-2);
    } 
}

最后

以上就是花痴水壶最近收集整理的关于上海交通大学 Fibonacci(java)的全部内容，更多相关上海交通大学 Fibonacci(java)内容请搜索靠谱客的其他文章。