剑指offer 矩形覆盖

[code]#include <iostream>

using namespace std;

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

        int prelast = 1,last = 2;
        int index = 0;
        int sum = 0;

        for(index = 3;index <= number; index++)
        {
            sum = prelast + last;
            prelast = last;
            last = sum;
        }
        return sum;
    }
};

int main()
{
    Solution s;
    cout << s.rectCover(4) << endl;

    return 0;
}