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
相關文章
相關標籤/搜索