如跳台阶一般,是为规律题:
跳1,2,那么是f(n)=f(n-1)+f(n-2);
那么1,2,3,n类推:f(n)=f(n-1)+....+f(1);
找出规律:
class Solution { public: int jumpFloorII(int number) { int n1=1; int n2=2; int sum1=4; int sum=0; if(number==1) { return 1; } if(number==2) { return 2; } else { for(int i=3;i<=number;i++) { sum=sum+sum1; sum1=sum; } return sum; } } }; |