Maximal Rectangle Problem


Description

LeetCode Problem 85.

Given a rows x cols binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.

Example 1:

1
2
3
Input: matrix = [["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
Output: 6
Explanation: The maximal rectangle is shown in the above picture.

Example 2:

1
2
Input: matrix = []
Output: 0

Example 3:

1
2
Input: matrix = [["0"]]
Output: 0

Example 4:

1
2
Input: matrix = [["1"]]
Output: 1

Example 5:

1
2
Input: matrix = [["0","0"]]
Output: 0

Constraints:

  • rows == matrix.length
  • cols == matrix[i].length
  • 0 <= row, cols <= 200
  • matrix[i][j] is ‘0’ or ‘1’.


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
class Solution {
public:
    int maximalRectangle(vector<vector<char>>& matrix) {
        int r = matrix.size();
        if (r == 0) return 0;
        int c = matrix[0].size();
        
        int max_area = 0;
        int area, k, tp;
        stack<int> s;
        vector<int> line;
        vector<vector<int>> dp;
        
        for (int i = 0; i < r; i ++) {
            line.clear();
            for (int j = 0; j < c; j ++) {
                if (matrix[i][j] == '0')
                    line.push_back(0);
                else {
                    if (i > 0)
                        line.push_back(dp[i-1][j] + 1);
                    else 
                        line.push_back(matrix[i][j] - '0');
                }
            }   
            dp.push_back(line);
            
            k = 0;
            while (k < c) {
                if ((s.empty()) || (line[s.top()] < line[k])) {
                    s.push(k);
                    k ++;
                } else {
                    tp = s.top();
                    s.pop();
                    area = line[tp] * (s.empty() ? k : k - s.top() - 1);
                    if (area > max_area)
                        max_area = area;
                }
            }
            while (!s.empty()) {
                tp = s.top();
                s.pop();
                area = line[tp] * (s.empty() ? k : k - s.top() - 1);
                if (area > max_area)
                    max_area = area;
            }
        }
        return max_area;
    }
};




Related Posts

Min Stack Problem

LeetCode 155. Design a stack that supports push, pop, top,...

Binary Search Tree Iterator Problem

LeetCode 173. Implement the BSTIterator class that represents an iterator...

Evaluate Reverse Polish Notation Problem

LeetCode 150. Evaluate the value of an arithmetic expression in...

Maximal Rectangle Problem

LeetCode 85. Given a rows x cols binary matrix filled...

Largest Rectangle in Histogram Problem

LeetCode 84. Given an array of integers heights representing the...

Simplify Path Problem

LeetCode 71. Given a string path, which is an absolute...