JAVA程序设计（自主模式）-求斐波拉契数

版权声明：文章都是原创，转载请注明~~~~ https://blog.csdn.net/SourDumplings/article/details/88391827

求斐波拉契数

斐波拉契数为，Fib(N) = Fib(N-1)+Fib(N-2) F(0)=F(1)=1 用Java编写能求Fib(N)的程序 输入为N,须输出Fib(N)
如输入
3
输出：
3

Java:

/**
 * @Date    : 2018-04-06 13:52:54
 * @Author  : 酸饺子 ([email protected])
 * @Link    : https://github.com/SourDumplings
 * @Version : $Id$
 *
 * 求斐波那契数
*/

import java.util.*;
import java.io.*;

public class Main
{
    public static void main(String[] args)
    {
        Scanner cin = new Scanner(System.in);
        int N = cin.nextInt();
        System.out.println(fib(N));
    }
    public static long fib(int N)
    {
        if (N == 0 || N == 1)
        {
            return 1;
        }
        else
        {
            long[] res = new long[N+1];
            res[0] = res[1] = 1;
            for (int i = 2; i != N + 1; ++i)
            {
                res[i] = res[i-1] + res[i-2];
            }
            return res[N];
        }
    }
}