返回题库|

最大子矩阵 117

困难阿里巴巴

最大子矩阵 117

困难阿里巴巴动态规划

题目描述

给定一个仅包含 0 和 1 的二维二进制矩阵 mat,找出只包含 1 的最大矩形并返回其面积。矩阵中的每个元素可以看作是矩形的一个单元格,需要找到一个由连续 1 组成的最大矩形区域。

示例

输入:matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
输出:6
solution.ts
输出结果
点击「运行代码」按钮查看结果...