题解 | #跳台阶扩展问题#
跳台阶扩展问题
http://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387
本来想写成动态规划，结果发现规律太明显了
class Solution {
public:
int jumpFloorII(int number) {
vector<int> dp(number+1,0);
if(number<2) return 1;
return pow(2, number-1);
}
};
查看25道真题和解析