n*n的方砖最小要几块边长小于n的方砖才能铺满,用动态规划的角度解决此问题-n* n to a few of the smallest方砖side length less than n can be covered with the方砖with the perspective of dynamic programming to solve this problem