【DP】LeetCode 85. Maximal Rectangle

LeetCode 85. Maximal Rectangle

Solution1:
一语惊醒梦中人啊，参考链接：https://www.youtube.com/watch?v=2Yk3Avrzauk
根据第84题完成！

class Solution {
public:
    int maximalRectangle(vector<vector<char>>& matrix) {
        if (!matrix.size() || !matrix[0].size())
            return 0;
        int m = matrix.size(), n = matrix[0].size(), max_area = INT_MIN;;
        vector<vector<int> > dp(m, vector<int>(n, 0));
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (i == 0)
                    dp[i][j] = matrix[i][j] - '0';
                else {
                    if (matrix[i][j] - '0')
                        dp[i][j] = dp[i-1][j] + matrix[i][j] - '0';
                    else
                        dp[i][j] = matrix[i][j] - '0';
                }
            }
            int temp_sum = largestRectangleArea(dp[i]);
            max_area = max(max_area, temp_sum);
        }
        return max_area;
    }

    int largestRectangleArea(vector<int>& height) {
        int res = 0;
        for (int i = 0; i < height.size(); ++i) {
            if (i + 1 < height.size() && height[i] <= height[i + 1]) {
            //若把这个判断条件去掉，则是暴力算法复杂度是O(n^2)，只有最后一个case无法AC
                continue;
            }
            int minH = height[i];
            for (int j = i; j >= 0; --j) {
                minH = min(minH, height[j]);
                int area = minH * (i - j + 1);
                res = max(res, area);
            }
        }
        return res;
    }
};