迭代实现斐波那契数列c++

迭代实现斐波那契数列的 C 代码如下：

#include <stdio.h>

int fibonacci(int n) {
    int a = 0, b = 1, temp;
    if (n == 0)
        return a;    else if (n == 1)
        return b;
    else {
        for (int i = 2; i <= n; i++) {
            temp = a + b;
            a = b;
            b = temp;
        }
        return b;
    }
}

int main() {
    int n;
    printf("请输入要计算的斐波那契数列的项数：");
    scanf("%d", &n);
    
    int result = fibonacci(n);
    printf("第 %d 项的值为：%d\n", n, result);
    
    return 0;
}