剑指offer 矩形覆盖

 1 class Solution {
 2 public:
 3     int rectCover(int number) {
 4         if (number <= 2) {
 5             return number;
 6         }
 7         vector<int> v(number + 1, 0);
 8         v[1] = 1;
 9         v[2] = 2;
10         for (int i = 3; i <= number; i++) {
11             v[i] = v[i - 1] + v[i - 2];
12         }
13         return v[number];
14     }
15 };