递归和非递归分别实现求第n个斐波那契数

非递归 #define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> int Fib(int n) { if (n == 1 || n == 2) { return 1; } int last2 = 1; int last1 = 1; int cur = 0; for (int i = 3; i <

>>阅读原文<<