斐波那契数列求和
目錄
前言
一、C++
二、Java
三、JavaScript
前言
斐波那契函數求和,難度為入門級,本文提供了以下三種語言的核心代碼。
一、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 8if (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) }總結
- 上一篇: 计算机笔记检讨,没做笔记检讨书
- 下一篇: 多样加密功能全面升级细数猖獗作恶“五宗罪