2021年10月20日
[LeetCode] 1240. Tiling a Rectangle with the Fewest Squares 铺瓷砖
摘要： Given a rectangle of size n x m, return the minimum number of integer-sided squares that tile the rectangle. Example 1: Input: n = 2, m = 3 Output: 3 阅读全文
posted @ 2021-10-20 13:31 Grandyang 阅读(971) 评论(0) 推荐(0) 编辑
Fork me on GitHub