Leetcode 85. Maximal Rectangle (Hard) (cpp)

最新推荐文章于 2020-01-08 14:41:06 发布

Niko_Ke

最新推荐文章于 2020-01-08 14:41:06 发布

阅读量525

点赞数

分类专栏： Leetcode C++ C++ Leetcode Array Leetcode Hash Table Leetcode Stack Leetcode Dynamic Programming 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/53869609

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

Leetcode 85. Maximal Rectangle (Hard) (cpp)

Tag: Array, Hash Table, Stack, Dynamic Programming

Difficulty: Hard

/*

85. Maximal Rectangle (Hard)

Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.

For example, given the following matrix:

1 0 1 0 0
1 0 1 1 1
1 1 1 1 1
1 0 0 1 0
Return 6.

*/
class Solution {
public:
	int maximalRectangle(vector<vector<char>>& matrix) {
		if (matrix.empty()) {
			return 0;
		}
		int maxRec = 0;
		vector<int> height(matrix[0].size());
		for (int i = 0; i < matrix.size(); i++) {
			for (int j = 0; j < matrix[0].size(); j++) {
				height[j] = matrix[i][j] == '0' ? 0 : height[j] + 1;
			}
			maxRec = max(maxRec, largestRectangleArea(height));
		}
		return maxRec;
	}
private:
	int largestRectangleArea(const vector<int>& heights) {
		stack<int> s;
		int maxSize = 0;
		for (int i = 0; i <= heights.size(); i++) {
			int cur = i == heights.size() ? 0 : heights[i];
			while (!s.empty() && heights[s.top()] >= cur) {
				int height = heights[s.top()];
				s.pop();
				int left = s.empty() ? 0 : s.top() + 1;
				maxSize = max(maxSize, (i - left) * height);
			}
			s.push(i);
		}
		return maxSize;
	}
};