leetcode: 221. 最大正方形

221. 最大正方形

来源:力扣(LeetCode)

链接: https://leetcode.cn/problems/maximal-square/

在一个由 ‘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

leetcode: 221. 最大正方形_第1张图片

示例 2:

输入:matrix = [["0","1"],["1","0"]]
输出:1

leetcode: 221. 最大正方形_第2张图片

示例 3ÿ

你可能感兴趣的:(编程练习-Leetcode,leetcode,动态规划,算法训练,dp,最大正方形)