forked from black-shadows/InterviewBit-Topicwise-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathMaxRectangleInBinaryMatrix.cpp
More file actions
74 lines (56 loc) · 1.79 KB
/
Copy pathMaxRectangleInBinaryMatrix.cpp
File metadata and controls
74 lines (56 loc) · 1.79 KB
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
int Solution::maximalRectangle(vector<vector<int> > &A) {
// Do not write main() function.
// Do not read input, instead use the arguments to the function.
// Do not print the output, instead return values as specified
// Still have a doubt. Checkout www.interviewbit.com/pages/sample_codes/ for more details
if(A.size() == 0){
return 0;
}
vector<int> temp(A[0].size(), 0);
int i = 0;
int sol = 0;
while(i < A.size()){
for(int k = 0; k < A[i].size(); k++){
if(A[i][k] == 0){
temp[k] = 0;
}
else{
temp[k] = temp[k] + A[i][k];
}
}
stack<int> st;
int j = 0;
while(j < temp.size()){
if(st.empty() || temp[st.top()] <= temp[j]){
st.push(j);
j++;
}
else{
int top = st.top();
st.pop();
int area = 0;
if(st.empty()){
area = temp[top] * j;
}
else{
area = temp[top] * (j - st.top() - 1);
}
sol = max(sol, area);
}
}
while(!st.empty()){
int top = st.top();
st.pop();
int area = 0;
if(st.empty()){
area = temp[top] * j;
}
else{
area = temp[top] * (j - st.top() - 1);
}
sol = max(sol, area);
}
i++;
}
return sol;
}