题解 | #跳台阶#
跳台阶
https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
动态规划
#include <vector>
class Solution {
public:
int jumpFloor(int number) {
if(number<=2)
return number;
vector<int> dp(number);
dp[0] = 1;
dp[1] = 2;
for (int i = 2; i < number; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[number - 1];
}
};
查看19道真题和解析