一、题目要求
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
二、代码实现
int climbStairs(int n) {
int *a=(int*)new int[n+1];
a[0]=a[1]=1;
int i;
for(i=2;i<=n;i++)
a[i]=a[i-1]+a[i-2];
return a[n];
}