题目:
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?
解答:
递推实现
class Solution {
public:
int climbStairs(int n) {
if(n == 0)
return 1;
if(n == 1)
return 1;
vector<int> record;
record.push_back(1);
record.push_back(1);
for(int i = 2;i <= n;++i)
{
record.push_back(record[i - 1] + record[i - 2]);
}
return record[n];
}
};