MCPcopy Create free account
hub / github.com/LjyYano/LeetCode / L0085_MaximalRectangle

Class L0085_MaximalRectangle

src/main/java/L0085_MaximalRectangle.java:34–144  ·  view source on GitHub ↗

https://leetcode.cn/problems/maximal-rectangle/ 给定一个仅包含 0 和 1 、大小为 rows x cols 的二维二进制矩阵,找出只包含 1 的最大矩形,并返回其面积。 示例 1: ![img](https://assets.leetcode.com/uploads/2020/09/14/maximal.jpg) 输入:matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]] 输出:6 解释:最大矩形如

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected