矩形覆盖

问题描述

我们可以用21的小矩形横着或者竖着去覆盖更大的矩形。请问用n个21的小矩形无重叠地覆盖一个2*n的大矩形，总共有多少种方法？

比如n=3时，2*3的矩形块有3种覆盖方法：

来源：牛客网
链接：https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

C++代码实现

思路：1、写出每步找规律：n个矩形         f[n]
                                             0                      0
                                             1                      1
                                             2                      2
                                             3                      3
                                             4                      5
                                             5                      8
                                        =>n                 f[n-1]+f[n-2]
          2、逻辑推导
                n = 1
                       只能横着覆盖，一种
                n = 2
                       可以横着和竖着覆盖，两种
                n = 3
                       第三级横着覆盖，用了一级，剩下 n = 2，有两种覆盖方法
                       第三季竖着覆盖，用了两级，剩下 n = 1，有一种覆盖方法
                       总共有 3 种
                n = 4
                       第 4 级横着覆盖，用了一级，剩下 n = 3，有三种覆盖方法
                       第 4 级竖着覆盖，用了两级，剩下 n = 2，有两种覆盖方法
                       总共有 5 种方法
                n = n
                       第 n 级横着覆盖，用了一级，剩下 n = n - 1，所以关注第 n - 1 种有几种覆盖方法
                       第 n 级竖着覆盖，用了两级，剩下 n = n - 2，所以关注第 n - 2 种有几种覆盖方法
                       总和为两种情况的总和

class Solution {
public:
    int rectCover(int number) {
        if (number == 0)
            return 0;
        else if (number == 1)
            return 1;
        else
        {
            int a = 1;
            int b = 2;
            while(--number > 1)
            {
                b = a + b;
                a = b - a;
            }
            return b;
        }
    }
};

python2代码实现

# -*- coding:utf-8 -*-
# -*- coding:utf-8 -*-
class Solution:
    def rectCover(self, number):
        # write code here
        if number == 0:
            return 0
        elif number == 1:
            return 1
        else:
            a = 1
            b = 2
            for i in range(1, number-1):
                b = a + b
                a = b - a
            return b

java代码实现

public class Solution {
    public int RectCover(int target) {
        if (target == 0)
            return 0;
        else if (target == 1)
            return 1;
        else
        {
            int a = 1;
            int b = 2;
            while(--target > 1)
            {
                b = a + b;
                a = b - a;
            }
            return b;
        }
    }
}