LeetCode 85. 最大矩形（DP/單調遞增棧，難）

文章目錄 1. 題目 2. 解題 2.1 DP 2.2 單調遞增棧 1. 題目 給定一個僅包含 0 和 1 的二維二進制矩陣，找出只包含 1 的最大矩形，並返回其面積。web 示例: 輸入: [ ["1","0","1","0","0"], ["1","0","1","1","1"], ["1","1","1","1","1"], ["1","0","0","1","0"] ] 輸

>>阅读原文<<