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?
Subscribe to see which companies asked this question
class Solution {
public:
int climbStairs(int n) {
if(n == 0) return 0;
if(n == 1) return 1;
if(n == 2) return 2;
vector<int> vec(n+1, 0);
vec[1]=1;
vec[2]=2;
for(int i=3; i <= n; i++) {
vec[i] = vec[i-1]+vec[i-2];
}
return vec[n];
}
};