矩形覆盖(斐波那契数列)
矩形覆盖
http://www.nowcoder.com/questionTerminal/72a5a919508a4251859fb2cfb987a0e6
/*
f(4)=f(3)+f(2)
其中f(0)=0;f(1)=1;f(2)=2;
*/
class Solution {
public:
int rectCover(int number){
if(!number)return 0;
int a=1,b=2;
while(--number){
b=a+b;
a=b-a;
}
return a;
}
};
