10、剑指offer--矩形覆盖

 1 #include <iostream>
 2 using namespace std;
 3 class Solution {
 4 public:
 5     //fn=f(n-1)+f(n-2)
 6     int rectCover(int number) {
 7         int result[3]={0,1,2};
 8         if(number<=2)
 9             return result[number];
10         int f1 = 1;
11         int f2 = 2;
12         int fn = 0;
13         for(int i=3;i<=number;i++)
14         {
15             fn = f1 + f2;
16             f1 = f2;
17             f2 = fn;
18         }
19         return fn;
20     }
21 };
22 int main()
23 {
24     int n;
25     while(cin>>n)
26     {
27         Solution s;
28         cout<<"1*2小矩形放入2*"<<n<<"大矩形中有"<<s.rectCover(n)<<"种放法"<<endl;
29     }
30     return 0;
31 }