爬楼梯

dynamic programming algorithm–climb stairs

#include <stdio.h>int result[100];int f(int n){    int res;    if(result[n]>=0) return result[n];    if(n==0||n==1) res=1;    else res=f(n-1)+f(n-2);    result[n]=res;    return res;}int main(){    int i;    int n;    scanf("%d",&n);    for(i=0;i<=n;i++)    {        result[i]=-1;    }    printf("%d\n",f(n));    return 0;}