剑指offer 刷题笔记JZ10矩形覆盖

class Solution {
public:
    
    void _rectcover(int rec,int goal,int* count)
    {
        if(rec > goal) return;
        if(rec == goal) 
        {
            (*count)++;
            return;
        }
        _rectcover(rec+1,goal,count);
        _rectcover(rec+2,goal,count);
    }
    
    int rectCover(int number) {
        if(number == 0) return 0;
        int count = 0;
        _rectcover(0,number,&count);
        return count;
    }
};

本题实现基本与JZ8跳台阶完全相同…可参考本人博客https://blog.csdn.net/Wangsir1122/article/details/108550443