题目//求第n个斐波那契数列的值非递归思路//斐波那契数列指的是从1开始后面的数等于前面两个数的和例1,1,2,3,5,8,13,21,34…#define _CRT_SECURE_NO_WARNINGS #includestdio.h #includewindows.h int fibonacci(int n) { int first 1; int second 1; int third 1; while(n2){ third first second; first second; second third; n--; } return third; } int main(){ int n 1; int i 1; printf(请输入你要求的第几个斐波那契数); scanf(%d,n); ifibonacci(n); printf(%d\n, i); system(pause); return 0; }运行结果
C语言—求第n个斐波那契数列的值（非递归）
发布时间：2026/7/28 17:48:13
题目//求第n个斐波那契数列的值非递归思路//斐波那契数列指的是从1开始后面的数等于前面两个数的和例1,1,2,3,5,8,13,21,34…#define _CRT_SECURE_NO_WARNINGS #includestdio.h #includewindows.h int fibonacci(int n) { int first 1; int second 1; int third 1; while(n2){ third first second; first second; second third; n--; } return third; } int main(){ int n 1; int i 1; printf(请输入你要求的第几个斐波那契数); scanf(%d,n); ifibonacci(n); printf(%d\n, i); system(pause); return 0; }运行结果
效果)
