矩形覆盖

题目描述
我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形，总共有多少种方法？

斐波那契数列
1、递归

class Solution {
public:
    int rectCover(int number) {
        if (number == 0) return 0;
        if (number == 1) return 1;
        if (number == 2) return 2;
        return rectCover(number - 2) + rectCover(number - 1);
    }
};

2、非递归

class Solution {
public:
    int rectCover(int number) {
        if (number == 0) return 0;
        if (number == 1) return 1;
        if (number == 2) return 2;
        int count = 3, res = 3, fig1 = 2, fig2 = 3;
        while (count != number) {
            res = fig1 + fig2;
            fig1 = fig2;
            fig2 = res;
            count++;
        }
        return res;
    }
};