Solution

• 本质还是斐波那契数列，递归法或迭代法

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