题目描述:
一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
推理过程:
提交代码:
class Solution {
public:
int jumpFloorII(int number) {
int sum = 0;
if (number == 0) {
return 0;
}
if (number == 1) {
return 1;
}
if (number == 2) {
return 2;
}
sum = sum + 2 * jumpFloorII(number - 1);
return sum;
}
};
测试:
int main()
{
Solution *s = new Solution();
long int out =s->jumpFloorII(4);
cout << out << endl;
system("pause");
return 0;
}
结果 :