Question

C++用数组的方法求Fibonacci数列的第n项

Answer 1

#include<iostream>
using namespace std;
int main(void)
{
int n,i,*fib;
cin>>n;
if(n==1||n==2)
cout<<"第"<<n<<"是: 1"<<endl;
else
{
fib=new int[n];
fib[0]=fib[1]=1;
for(i=2;i<n;i++)
fib[i]=fib[i-2]+fib[i-1];
for(i=0;i<n;i++)
cout<<"第"<<i<<"是: "<<fib[i]<<endl;
delete[] fib;
}
return 0;
}

Answer 2

/*用数组的方法求Fibonacci数列的第n项*/
#include<iostream>
using namespace std;
int main(void)
{
int n,i,*fib;
cin>>n;
if(n==1||n==2)
cout<<"第"<<n<<"项是: 1"<<endl;
else
{
fib=new int[n];
fib[0]=fib[1]=1;
for(i=2;i<n;i++)
fib[i]=fib[i-2]+fib[i-1];
for(i=0;i<n;i++)
cout<<"第"<<i<<"项是: "<<fib[i]<<endl;
delete[] fib;
}
return 0;
}