leetcode221 Maximal Square-zh
# 221. 最大正方形 (opens new window)
English Version (opens new window)
# 题目描述
在一个由 '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.lengthn == matrix[i].length1 <= m, n <= 300matrix[i][j]为'0'或'1'
# 解法
# Python3
1
# Java
1
# ...
1
编辑 (opens new window)
上次更新: 2021/10/30, 12:58:38