??題目：斐波那契數(shù)列芍躏。
程序分析：斐波那契數(shù)列（Fibonacci sequence），又稱黃金分割數(shù)列宪巨，指的是這樣一個數(shù)列：0磷杏、1、1揖铜、2茴丰、3、5天吓、8贿肩、13、21龄寞、34汰规、……。
??實例
??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);
}
遇到此類問題物邑，但看了文章還是未解決溜哮，
評論或加 QQ：781378815
