题解 | #跳台阶#
跳台阶
https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4
class Solution {
public:
// 1. 动态规划
int jumpFloor(int number) {
if(number == 1)
{
return 1;
}
if (number == 2) {
return 2;
}
int a = jumpFloor(number-1);
int b = jumpFloor(number-2);
return a+b;
// int x=1;
// int y=2;
// int temp;
// for (int k=3; k<=number; k++) {
// temp=x+y;
// x=y;
// y=temp;
// }
// return temp;
}
};
查看3道真题和解析
腾讯一面2166人在聊
