85. 最大矩形(hard)
给定一个仅包含0 和 1 的二维二进制矩阵,找出只包含 1 的最大矩形,并返回其面积。示例:输入:[ ["1","0","1","0","0"], ["1","0","1","1","1"], ["1","1","1","1","1"], ["1","0","0","1","0"]]输出: 6把每一层看作是柱状图,对每一行求一个高度,这个高度就是对应的连续1的长度,对每一行就柱状图的最大面积求柱状图的最大面积用单调栈,https://www.cnblogs.com/l...
原创
2020-10-25 12:47:45 ·
173 阅读 ·
0 评论