Leetcode--85. 最大矩形

给定一个仅包含 0 和 1 的二维二进制矩阵，找出只包含 1 的最大矩形，并返回其面积。java 示例:数组 输入: [   ["1","0","1","0","0"],   ["1","0","1","1","1"],   ["1","1","1","1","1"],   ["1","0","0","1","0"] ] 输出:6测试 思路：动态规划io 用dp二维数组保存每一个位置以它结尾的，1

>>阅读原文<<