题解 | #矩形覆盖#

class Solution {
public:
    int rectCover(int number) {
        int old=1,last=2,now;
        if(number==0) return 0;
        if(number==1) return 1;
        if(number==2) return 2;
        for(int i=3;i<=number;i++){
            now=old+last;
            old=last;
            last=now;
        }
        return now;
    }
};