-
Notifications
You must be signed in to change notification settings - Fork 0
/
MaximalSquare.cpp
55 lines (48 loc) · 1.22 KB
/
MaximalSquare.cpp
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
class Solution {
public:
int minof3(int a, int b, int c)
{
return std::min({a, b, c});
}
int maximalSquare(vector<vector<char>>& matrix) {
int m = matrix.size();
if(m == 0)
return 0;
int n = matrix[0].size();
int a[m][n];
int i = 0,j = 0;
int max = 0;
for (i = 0; i < n; i++)
{
a[0][i] = (matrix[0][i] == '1')? 1: 0;
if(!max && a[0][i])
max = 1;
}
if(m == 1)
return max;
for (i = 0; i < m; i++)
{
a[i][0] = (matrix[i][0] == '1')? 1: 0;
if(!max && a[i][0])
max = 1;
}
if(n == 1)
return max;
for (i = 1; i < m; i++)
{
for (j = 1; j < n; j++)
{
if(matrix[i][j] == '1')
{
a[i][j] = minof3(a[i-1][j-1], a[i-1][j], a[i][j-1]) + 1;
}
else
{
a[i][j] = 0;
}
max = (max < a[i][j]) ? a[i][j] : max;
}
}
return max*max;
}
};