? 我的網(wǎng)站: www.mengyingjie.com ?

??題目：斐波那契數(shù)列。

程序分析：斐波那契數(shù)列（Fibonacci sequence），又稱黃金分割數(shù)列，指的是這樣一個(gè)數(shù)列：0、1、1、2、3、5、8、13、21、34、……。

??實(shí)例

??Python

# Python 3.0+
def fib(n):
    a, b = 0, 1
    for i in range(n):
        print(a, end=" ")
        a, b = b, a + b
    return a
fib(10)

?java

// java
package mengyingjie.org;
public class Sixth {
    public void fibo(int n){
        int a = 0, b= 1, tem;
        for (int i = 0; i < n; i ++){
            System.out.print(a + " ");
            tem = a;
            a = b;
            b = tem + b;
        }
    }
    public static void main(String[] args) {
        Sixth sixth = new Sixth();
        sixth.fibo(10);
    }
}

??C++

// c++
#include <iostream>
using namespace std;
void fibo(int n){
    int a = 0, b = 1, copy;
    for (int i = 0; i < n; i++) {
        cout << a << " ";
        copy = a;
        a = b;
        b = copy + b;
    }
}
int main(){
    fibo(10);
}

遇到此類問(wèn)題，但看了文章還是未解決，
評(píng)論或加 QQ：781378815