leetcode 221. Maximal Square

最新推荐文章于 2021-11-24 21:20:25 发布

原创最新推荐文章于 2021-11-24 21:20:25 发布 · 236 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 2 个专栏收录

62 篇文章

订阅专栏

动态规划&贪心

7 篇文章

订阅专栏

本文介绍了一种寻找矩阵中最大正方形面积的方法，并提供了一个详细的C++实现方案。此外，还探讨了如何计算矩阵中最大矩形的面积，包括构造直方图和使用单调栈来解决该问题。

class Solution {// 最大正方形面积 
public:
    int maximalSquare(vector<vector<char>>& matrix) {
        if (matrix.empty()) { return 0; }
        long len = 0;
        vector<vector<int>> dp(matrix.size(), vector<int>(matrix[0].size(), 0));
        
        for (int row = 0; row < matrix.size(); ++row)
            for (int col = 0; col < matrix[row].size(); ++col){
                if (!col || !row)
                    dp[row][col] = matrix[row][col] - '0';
                else if (matrix[row][col] != '0'){
                    if (dp[row][col - 1] != dp[row - 1][col])
                        dp[row][col] = min (dp[row][col - 1], dp[row - 1][col]) + 1;
                    else{
                        int len = dp[row][col - 1];
                        dp[row][col] = len;
                     // error: if(dp[row - len][col - len]): tricky! for instance {{0,0},{0,1}}
                     // dp[1][1] equals to 1, but we get 0
                        if (matrix[row - len][col - len] != '0') 
                            dp[row][col]++;
                    }
                }
                len = max (len,  static_cast<long>(dp[row][col]));
            }
        return len * len; 
    }
};

void buildHistogram(vector<string> &matrix, vector<vector<int>>& histogram) { // 构造图
	for (int col = 0; col < matrix[0].size(); ++col)
		for (int row = (int)matrix.size() - 1; row >= 0; --row) {
			if (matrix[row][col] != '0') {
				histogram[row][col] = 1;
				if (row < (int)matrix.size() - 1)
					histogram[row][col] += histogram[row + 1][col];
			}
		}
}
int  rowMaxRectangle(vector<int>& heights) {// 利用升序栈
	int ret = 0;
	stack<int> _stack;
	for (int i = 0; i < heights.size();) {
		if (_stack.empty() || heights[_stack.top()] <= heights[i])
			_stack.push(i++);
		else {
			int val = heights[_stack.top()];
			_stack.pop();
			int leftPos = _stack.empty() ? 0 : (_stack.top() + 1);
			ret = max(ret, val * (i - leftPos));
		}
	}
	while (!_stack.empty()) {
		int val = heights[_stack.top()];
		_stack.pop();
		int leftPos = _stack.empty() ? 0 : (_stack.top() + 1);
		ret = max(ret, val * ((int)heights.size() - leftPos));
	}
	return ret;
}
int maxRectangle(vector<string> &matrix) { // 求最大长方形 

	if (matrix.empty())
		return 0;
	vector<vector<int>> histogram(matrix.size(), vector<int>(matrix[0].size(), 0));
	buildHistogram(matrix, histogram);
	int ret = 0;
	for (auto heights : histogram)
		ret = max(ret, rowMaxRectangle(heights));
	return ret; 
}