做emc的有哪些网站,北京公司网站建设定制,小程序推广计划怎么做,手机app下载大全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];}
};
