牛客-矩形覆蓋

牛客-矩形覆蓋

#include <stdio.h>
#include <queue>
#include <stack>
#include <math.h>
#include <map>
#include <string.h>
#include <string>
#include <cstring>
#include <set>
#include <algorithm>
#include <vector>
using namespace std;

class Solution {
public:
    int rectCover(int number) {
        if(number == 0 || number == 1 || number == 2) {
            return number;
        }
        int last1=1;
        int last2=2;
        int ans=0;
        for (int i=3; i<=number; i++) {
            ans=last1+last2;
            last1=last2;
            last2=ans;
        }
        return ans;
    }
};