迭代
变态跳台阶
http://www.nowcoder.com/questionTerminal/22243d016f6b47f2a6928b4313c85387
class Solution {
public:
int jumpFloorII(int number) {
int a=0;
if(number==1||number==0)
return 1;
for(int i=1;i<=number;i++){
int b=jumpFloorII(number-i);
a+=b;
}
return a;
}
};
