斐波那契数列第N项的值---动态规划

const int MAX = 101;
double map[MAX];

// 数组map[MAX]暂存中间调用结果，避免重复计算 */

double fib(int n){if (n == 1 || n == 2){return 1;}else if (map[n] > 0){return map[n];}else{map[n] = fib(n-1) + fib(n-2);return map[n];}}