斐波拉契数列介绍
- 斐波拉契数列除了第一个和第二个数为1外,以后的数都是前面两个数之和;
- 数学表示为:F(0)=1,F(1)=1;N>=2;F(N) = F(N-1)+F(N-2);
- 最后产生斐波那契数列如下:
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …
代码实现
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
using namespace std;
unsigned Fibonacci_Seq_Gen(vector<long long> &seq, unsigned count)
{
unsigned idx = 2;
long long tempNum = 0;
if(count <= 2)
{
cout<<"The input parameter is illegal"<<endl;
return 0;
}
seq.push_back(1);
seq.push_back(1);
do
{
tempNum = seq[idx-1]+seq[idx-2];
seq.push_back(tempNum);
idx++;
} while (idx<count);
return count;
}
int main(int argc, char* argv[])
{
vector<long long> seq;
cout<<"The Fibonacci_Seq_Gen out:"<<Fibonacci_Seq_Gen(seq, 50)<<endl;
for(int i = 0;i<seq.size();i++)
{
cout<<seq[i]<<endl;
}
return 0;
}