剑指 Offer 10- I. 斐波那契数列

剑指 Offer 10- I. 斐波那契数列

题目

代码

#include 
#include 
using namespace std;

int fib(int n) {
	long fn = 1000000007;
	if(n < 2){
		return n;
	}
	vector<int> dp(n + 1);
	dp[0] = 0; dp[1] = 1;
	for(int i = 2; i <= n; i++){
		dp[i] = (dp[i - 1] + dp[i - 2]) % fn;
	}
	return dp[n];
}

int main(){
	int n, res;
	cin>>n;
	res = fib(n);
	cout<<res;
	return 0;
}