简单的动态规划问题：
class Solution {
public:
int climbStairs(int n) {
vector<int> stairs(n,0);
stairs[0] = 1;
stairs[1] = 2;
for (int index=2;index<stairs.size();index++){
stairs[index] = stairs[index-1]+ stairs[index-2];
}
return stairs[n-1];
}
};
简单的动态规划问题：
Description You are climbing a stair case. It takes n ste...
70. Climbing Stairs Description You are climbing a stair ...
[Scene: The hallway, Ross is running up the stairs. Note:...
Several white concrete stairs lead to the front glazed do...
https://leetcode-cn.com/problems/climbing-stairs/
https://leetcode.com/problems/climbing-stairs/description...
title: Climbing Stairstags:- climbing-stairs- No.70- simp...
1.On the stairs , Lydia's brother yawns , still twined in...
造句： 1. I descended the stairs slowly and went into the ba...
本文标题：LeetCode-Climbing Stairs
本文链接：https://www.haomeiwen.com/subject/tkfxxqtx.html
网友评论