很多时候明明知道应该用单调栈求解,但是最后始终写不出来,因此创作于此加深印象.
1、单调递增栈
for i , num in enumerate(nums):
whilestack and nums[stack[-1]] > num:
stack.pop()
stack.append(i)
2、单调递减栈
for i , num in enumerate(nums):
while stack and nums[stack[-1]] < num:
stack.pop()
stack.append(i)
一、单调递增栈应用
1、单调递增栈可以求解最大矩形面积,也就是单调递增栈弹出的值是这个区间范围内的最小值
nums = [0] + nums + [0]
for i , num in enumerate(nums):
whilestack and nums[stack[-1]] > num:
j = stack.pop()
ans = max(ans,(i-stack[-1]-1)*nums[j])
stack.append(i)
2、单调递增栈也可以求解右侧比这个值小的位置
nums = [0] + nums
n = len(nums)
right_label = list(range(n))
stack = []
for i , num in enumerate(nums):
while stack and nums[stack[-1]] > num:
right_label[stack.pop()] = i
stack.append(i)
二、单调递减栈应用
1、单调递减栈可以求解接雨水问题,也就是单调递增栈弹出的值是这个区间范围内的最大值
for i , num in enumerate(nums):
while stack and nums[stack[-1]] <= num:
j = stack.pop()
if stack:
ans += (min(nums[stack[-1]],num) - nums[j]) * (i - stack[-1]-1)
stack.append(i)
2、单调递增栈也可以求解右侧比这个值大的位置
nums = [0] + nums
n = len(nums)
right_label = list(range(n))
stack = []
for i , num in enumerate(nums):
while stack and nums[stack[-1]] < num:
right_label[stack.pop()] = i
stack.append(i)