请分别设计一个递归和非递归算法来计算F(n)
F列可递归定义为:
n为大于等于0的整数
F(n)=n 当n=0,1,2
F(n)=F(n-1) - F(n-3) 当n>=3
F列可递归定义为:
n为大于等于0的整数
F(n)=n 当n=0,1,2
F(n)=F(n-1) - F(n-3) 当n>=3
const
int
Max
=
1000000
;
bool got[Max];
int gotVal[Max];
int Cal( int n) {
if(got[n]) return gotVal[n];
got[n]=1;
return Cal(n-1)-Cal(n-3);
}
int main() {
int n;
got[0]=got[1]=got[2]=1;
gotVal[0]=0,gotVal[1]=1,gotVal[2]=2;
while(cin>>n, n>=0 && n<Max){
cout<<Cal(n)<<endl;
}
return 0;
}
bool got[Max];
int gotVal[Max];
int Cal( int n) {
if(got[n]) return gotVal[n];
got[n]=1;
return Cal(n-1)-Cal(n-3);
}
int main() {
int n;
got[0]=got[1]=got[2]=1;
gotVal[0]=0,gotVal[1]=1,gotVal[2]=2;
while(cin>>n, n>=0 && n<Max){
cout<<Cal(n)<<endl;
}
return 0;
}
//
non-recursive
const int Max = 1000000 ;
int max;
int F[Max];
int main() {
int n;
F[0]=0,F[1]=1,F[2]=2;
while(cin>>n, n>=0 && n<Max){
if(n<=max){
cout<<F[n]<<endl;
continue;
}
for(int i=max+1;i<=n;i++) F[i]=F[i-1]-F[i-3];
max=n;
cout<<F[n]<<endl;
}
return 0;
}
const int Max = 1000000 ;
int max;
int F[Max];
int main() {
int n;
F[0]=0,F[1]=1,F[2]=2;
while(cin>>n, n>=0 && n<Max){
if(n<=max){
cout<<F[n]<<endl;
continue;
}
for(int i=max+1;i<=n;i++) F[i]=F[i-1]-F[i-3];
max=n;
cout<<F[n]<<endl;
}
return 0;
}