接雨水DP速解及单调栈解法

题目leetcode42:. - 力扣（LeetCode）

解法一：DP动态规划速解，hard变easy中easy 

       每个块能装的水由其左侧最高节点以及右侧最高节点得出，注意不要用单调栈的思维定势，不是左右第一个比其高的，这个规律不用多说，找到左右最高的中的最低的，减去当前高度，乘以宽度1，加和就是总水量，至于一个点的左右最高则由动归一次遍历求出：

package main

import "math"

func trap(height []int) int {
	n := len(height)
	rightDp := make([]int, n)
	leftDp := make([]int, n)

	leftDp[0] = 0
	leftMax := height[0]
	for i := 1; i < n; i++ {
		leftDp[i] = leftMax
		if height[i] > leftMax {
			leftMax = height[i]
		}
	}

	rightDp[n-1] = 0
	rightMax := height[n-1]
	for i := n - 2; i >= 0; i-- {
		rightDp[i] = rightMax
		if height[i] > rightMax {
			rightMax = height[i]
		}
	}

	sum := 0
	for i := 0; i < n; i++ {
		conHeight := int(math.Min(float64(leftDp[i]), float64(rightDp[i])))
		if conHeight > height[i] {
			sum += conHeight - height[i]
		}
	}
	return sum
}

解法二：单调栈

在于以当前为跳板，以栈中前一个为界限：

package main

import (
	"container/list"
)

// 单调栈解法
func trap(height []int) int {
	sum := 0
	n := len(height)
	stack := list.New()
	for i := 0; i < n; i++ {
		if stack.Len() == 0 {
			stack.PushFront(i)
		} else {
			if height[i] <= height[stack.Front().Value.(int)] {
				stack.PushFront(i)
			} else {
				for stack.Len() != 0 && height[i] > height[stack.Front().Value.(int)] {
					ele := stack.Front()
					stack.Remove(ele)
					mid := height[ele.Value.(int)]
					if stack.Len() != 0 {
						leftValue := height[stack.Front().Value.(int)]
						if leftValue > height[i] {
							sum += (height[i] - mid) * (i - stack.Front().Value.(int) - 1)
						} else {
							sum += (leftValue - mid) * (i - stack.Front().Value.(int) - 1)
						}
					}
				}
				stack.PushFront(i)
			}
		}
	}

	return sum
}