摘要:
https://leetcode.com/problems/trapping-rain-water/ 思路一:参考 84. Largest Rectangle in Histogram,用 stack 做辅助 思路二:dynamic programming 阅读全文
摘要:
https://leetcode.com/problems/maximal-square/ dp[i][j] - 以 matrix[i][j] 为右下角的正方形的最大边长 阅读全文