请教一下斐波那契数列的非递归算法

[yunqibuhao]

如题

[zhOu]

还有你想显示到多少代 就把（代数—2）替换for循环中的10就可以了

[pathuang68]

#include <iostream>
using namespace std;

int main(void)
{
	int N = 0;
    int first = 1;
    int second = 1;
    int temp;

	cin >> N;

	cout << "Result: " << endl;
    cout << "F[1] = " << first << endl;
    cout << "F[2] = " << second << endl;
    for(int i = 2; i < N; i++)
	{
        temp = first + second;
        first = second;
        second = temp;
        cout << "F[" << i + 1 << "] = " << temp << endl;
    }
	
	return 0;
}

[mengmingtao]

直接输出吗？

#include <iostream>
using namespace std;

int main(){
    int first = 0;
    int second = 1;
    int temp;
    cout << first <<' ';
    cout << second <<' ';
    for(int i=0;i<10;i++){
        temp = first + second;
        first = second;
        second = temp;
        cout <<temp<<' ';
    }
}

[JieTouLangRen]

迭代~

[zhOu]

[Quote=引用 1 楼 mengmingtao 的回复:]
直接输出吗？
C/C++ code
#include <iostream>
using namespace std;

int main(){
int first = 0;
int second = 1;
int temp;
cout << first <<' ';
cout << second <<' ';
for(int i=0;i<10;i……
[/Quote]

#include <stdio.h>

int main(){
int first = 0;
int second = 1;
int temp;
int i;
printf("first\n");
printf("second\n");
for(i=0;i<10;i++){
temp = first + second;
first = second;
second = temp;
printf("%d\n",temp);
}
while(1);
}
这是我对2楼程序用c语言编写的内容
在dev c++环境下运行成功 你用tc或者vc可以把while（1）删掉