class Solution {
public:
int climbStairs(int n) {
int *res = new int[n+1];
for(int i=0;i<n+1;++i)
res[i] = 0;
res[1] = 1;
res[2] = 2;
for(int i=3;i<n+1;++i)
res[i] = res[i-1]+res[i-2];
return res[n];
}
};
70 Climbing Stairs
最新推荐文章于 2024-05-10 22:05:16 发布