• 递归
  • 递推公式：f(n)=f(n-1)+f(n-2)；
class Solution {
public:
    int rectCover(int number) {
        if (number <= 3) return number;
        return rectCover(number - 1) + rectCover(number - 2);
    }
};