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?
DP
class Solution {
public:
int climbStairs(int n) {
int a[1000],i;
a[0] = 1;
a[1] = 2;
for(i=2;i<n;i++){
a[i]=a[i-1]+a[i-2];
}
return a[n-1];
}
};