题目
LeetCode 221.最大正方形
解释
## 题目描述 在一个由 '0' 和 '1' 组成的二维矩阵内,找到只包含 '1' 的最大正方形,并返回其面积。 ## 示例 **示例 1:** **输入:** matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]] **输出:** 4 **示例 2:** **输入:** matrix = [["0","1"],["1","0"]] **输出:** 1 **示例 3:** **输入:** matrix = [["0"]] **输出:** 0 ## 约束条件 m == matrix.length n == matrix[i].length 1 <= m, n <= 300 matrix[i][j] 为 '0' 或 '1' ## LeetCode 链接 https://leetcode.cn/problems/maximal-square/
答案
正在疯狂整理答案中......