动态规划:斐波纳契数列

通过递归实现

int F(int i)
{
  if (i < 1) return 0;
  if (i == 1) return 1;
  return F(i-1) + F(i-2);
}


动态规划实现

int F(int i)
{
  int t;
  if (knownF[i] != unknown) return knownF[i];
  if (i == 0) t = 0;
  if (i == 1) t = 1;
  if (i > 1) t = F(i-1) + F(i-2);
  return knownF[i] = t;
}