-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathSolution.go
72 lines (57 loc) · 1.08 KB
/
Solution.go
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
package Solution
func maximalRectangle(matrix [][]byte) int {
m := len(matrix)
if m == 0 {
return 0
}
n := len(matrix[0])
if n == 0 {
return 0
}
dp := make([][]int, m)
for i := 0; i < m; i++ {
dp[i] = make([]int, n)
}
for j := 0; j < n; j++ {
dp[0][j] = int(matrix[0][j] - '0')
for i := 1; i < m; i++ {
if matrix[i][j] == '1' {
dp[i][j] = dp[i-1][j] + 1
}
}
}
max := 0
for i := 0; i < m; i++ {
area := largestRectangleArea(dp[i])
if area > max {
max = area
}
}
return max
}
func largestRectangleArea(heights []int) int {
heights = append(heights, -1)
hLen := len(heights)
left, right := 0, 0
area, maxArea := 0, 0
stack := []int{}
for right < hLen {
if len(stack) == 0 || heights[stack[len(stack)-1]] <= heights[right] {
stack = append(stack, right)
right++
continue
}
height := heights[stack[len(stack)-1]]
stack = stack[:len(stack)-1]
if len(stack) == 0 {
left = -1
} else {
left = stack[len(stack)-1]
}
area = height * (right - left - 1)
if area > maxArea {
maxArea = area
}
}
return maxArea
}