class Solution {
public:
int climbStairs(int n) {
if(n == 1 || n == 0) return 1;
if(n == 2) return 2;
vector<int> v(n+1,0);
v[0] = 1;
v[1] = 1;
v[2] = 2;
for(int i = 3;i < n+1;i++){
v[i] = v[i-1] + v[i-2];
}
return v[n];
}
};
爬楼梯
最新推荐文章于 2024-03-24 17:21:56 发布