丹徒做网站,上海模板建站软件,编程外包,教育网站首页源代码class Solution {
public:int climbStairs(int n) {if (n 1) return n;vectorint dp(n 1);dp[1] 1;dp[2] 2;for (int i 3; i n; i) {dp[i] dp[i - 1] dp[i - 2];}return dp[n];}
};
class Solution {
public:int climbStairs(int n) {if (n 1) return n;vectorint dp(n 1);dp[1] 1;dp[2] 2;for (int i 3; i n; i) {dp[i] dp[i - 1] dp[i - 2];}return dp[n];}
};
