斐波那契数列求和

最新推荐文章于 2024-08-23 14:24:16 发布

acheding

最新推荐文章于 2024-08-23 14:24:16 发布

阅读量1.2k

点赞数 1

文章标签： java c++ javascript

本文链接：https://blog.csdn.net/bDreamer/article/details/116536084

版权

前言

斐波那契函数求和，难度为入门级，本文提供了以下三种语言的核心代码。

一、C++

class Solution
{
public:
    int Fibonacci(int n)
    {
        if(n == 0 || n == 1)
            return n;
        int a = 0, b = 1, c = 0;
        for(int i = 2; i < n + 1; i++)
        {
            c = a + b;
            a = b;
            b = c;
        }
        return c;
    }
};

二、Java

public class Solution
{
    public int Fibonacci(int n)
    {
        if (n == 0 || n == 1)
            return n;
        int a = 0, b = 1, c = 0;
        for(int i = 2; i <= n; i++)
        {
            c = a + b;
            a = b;
            b = c;
        }
        return c;
    }
}

三、JavaScript

function Fibonacci(n)
{
    // 0 1 1 2 3 5 8
    if (n == 0 || n == 1)
        return n;
    var  a = 0, b = 1, c;
    for(let i = 2; i <= n; i++)
    {
        c = a + b;
        a = b;
        b = c;
    }
    return c;
    //return Fibonacci(n - 1) + Fibonacci(n - 2)
}