Fibonacci数列的动态规划思想

/*
  Name: Fibonacci数列的动态规划思想 
  Copyright: 
  Author: 
  Date: 22-03-17 08:56
  Description: 
*/
#include<iostream>
#include<cmath>

using namespace std;

const int N = 50;
int F[N] = {0, 1, 1};//Fibonacci数列
int sum = 0;

int Fibonacci(int n); //备忘录：自顶而下
int Fibonacci_2(int n);//动态规划：自底而上

int main() 
{
 	int n = 40;
 	int fn = Fibonacci(n);
 //	int fn = Fibonacci_2(n);
 	
 	for (int i=0; i<=n; i++)
 	{
	 	cout << F[i] << " ";
	}
 	cout << endl;
   
    system("pause");
    return 0;
}

int Fibonacci(int n) //备忘录：自顶而下
{
 	if (F[n] > 0)  //如果这个问题曾经计算过，直接返回 
 	{
		return F[n];
	}
    F[n] = Fibonacci(n-1) + Fibonacci(n-2);
    cout << ++sum << ": F[" << n << "]= " << F[n] << endl;
    
    return F[n];
}

int Fibonacci_2(int n)//动态规划：自底而上
{
 	for (int i=3; i<=n; i++)
 	{
	 	F[i] = F[i-1] + F[i-2];
	}
	
	return F[n];
}