动态规划——斐波那契数

 #include<iostream>
#include<vector>
using namespace std;

int f(int n){
	if (n<=1) 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];
	}
	return dp[n];
}

int main(){
	cout<<"please input your number:"<<endl;
	int n;
	cin>>n;
	int results =0;
	results = f(n);
	printf("%d\n",results);
	return 0;
}

https://leetcode-cn.com/problems/fibonacci-number/