题解 | #跳台阶#
跳台阶
http://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
class Solution {
public:
int dp[50]{0};
int jumpFloor(int number) {
dp[1] = 1;
dp[2] = 2;
for(int i = 3;i <= number;i++){
dp[i] = dp[i-1] + dp[i-2];
}
return dp[number];
}
};
投递快手等公司10个岗位 >
剑心互娱一面2人在聊