algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-04 16:12:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix/84: clean up redundant code

Browse Source
This commit is contained in:
novahe
2021-06-10 23:52:39 +08:00
parent dbdc464dee
commit aa8912611f
3 changed files with 46 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram.go
View File

@ -1,32 +1,25 @@
package leetcode package leetcode
import "fmt"
func largestRectangleArea(heights []int) int { func largestRectangleArea(heights []int) int {
maxArea, stack, height := 0, []int{}, 0 maxArea := 0
for i := 0; i <= len(heights); i++ { n := len(heights) + 2
if i == len(heights) { // Add a sentry at the beginning and the end
height = 0 getHeight := func(i int) int {
} else { if i == 0 || n-1 == i {
height = heights[i] return 0
} }
if len(stack) == 0 || height >= heights[stack[len(stack)-1]] { return heights[i-1]
stack = append(stack, i) }
} else { st := make([]int, 0, n/2)
tmp := stack[len(stack)-1] for i := 0; i < n; i++ {
fmt.Printf("1. tmp = %v stack = %v\n", tmp, stack) for len(st) > 0 && getHeight(st[len(st)-1]) > getHeight(i) {
stack = stack[:len(stack)-1] // pop stack
length := 0 idx := st[len(st)-1]
if len(stack) == 0 { st = st[:len(st)-1]
length = i maxArea = max(maxArea, getHeight(idx)*(i-st[len(st)-1]-1))
} else {
length = i - 1 - stack[len(stack)-1]
fmt.Printf("2. length = %v stack = %v i = %v\n", length, stack, i)
}
maxArea = max(maxArea, heights[tmp]*length)
fmt.Printf("3. maxArea = %v heights[tmp]*length = %v\n", maxArea, heights[tmp]*length)
i--
} }
// push stack
st = append(st, i)
} }
return maxArea return maxArea
} }

4
leetcode/0084.Largest-Rectangle-in-Histogram/84. Largest Rectangle in Histogram_test.go
View File

@ -40,6 +40,10 @@ func Test_Problem84(t *testing.T) {
para84{[]int{1, 1}}, para84{[]int{1, 1}},
ans84{2}, ans84{2},
}, },
{
para84{[]int{2, 1, 2}},
ans84{3},
},
} }
fmt.Printf("------------------------Leetcode Problem 84------------------------\n") fmt.Printf("------------------------Leetcode Problem 84------------------------\n")

49
website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md
View File

@ -41,37 +41,38 @@ Output: 10
package leetcode package leetcode
import "fmt"
func largestRectangleArea(heights []int) int { func largestRectangleArea(heights []int) int {
maxArea, stack, height := 0, []int{}, 0 maxArea := 0
for i := 0; i <= len(heights); i++ { n := len(heights) + 2
if i == len(heights) { // Add a sentry at the beginning and the end
height = 0 getHeight := func(i int) int {
} else { if i == 0 || n-1 == i {
height = heights[i] return 0
} }
if len(stack) == 0 || height >= heights[stack[len(stack)-1]] { return heights[i-1]
stack = append(stack, i) }
} else { st := make([]int, 0, n/2)
tmp := stack[len(stack)-1] for i := 0; i < n; i++ {
fmt.Printf("1. tmp = %v stack = %v\n", tmp, stack) for len(st) > 0 && getHeight(st[len(st)-1]) > getHeight(i) {
stack = stack[:len(stack)-1] // pop stack
length := 0 idx := st[len(st)-1]
if len(stack) == 0 { st = st[:len(st)-1]
length = i maxArea = max(maxArea, getHeight(idx)*(i-st[len(st)-1]-1))
} else {
length = i - 1 - stack[len(stack)-1]
fmt.Printf("2. length = %v stack = %v i = %v\n", length, stack, i)
}
maxArea = max(maxArea, heights[tmp]*length)
fmt.Printf("3. maxArea = %v heights[tmp]*length = %v\n", maxArea, heights[tmp]*length)
i--
} }
// push stack
st = append(st, i)
} }
return maxArea return maxArea
} }
func max(a int, b int) int {
if a > b {
return a
}
return b
}
``` ```