c++斐波那契数列

#include<iostream>
#include<string>
#include<vector>//容器头文件 
#include<algorithm> //算法头文件 
#include <vector>
#include <typeinfo>
using namespace std;
//滚动数组 - 斐波那契 
int fib(int n){
    if(n <= 1) return n;//斐波那契0 1 2返回就是0 1 1
    int a = 0;
    int b = 1;
    int temp;
//每次让这两个“指针”向前滚动
    for(int i = 2 ; i <= n ;i++){
        temp = a+b;
        a = b;
        b = temp;
    }
    return temp;
}

//动态规划-斐波那契
int fib1(int n){
	if(n <= 1) return n;
	int arr[n+1];
	arr[0] = 0;
	arr[1] = 1;
	for(int i = 2 ; i <= n ; i++){
		arr[i] = arr[i-1] + arr[i-2]; 
	}
	return arr[n];
}
int main(){
    int n;
    cin >> n;
    int k = fib(n);
    cout<<k;
}