leetcode刷题 83 84

from collections import deque

class Solution: def largestRectangleArea(self, heights: List[int]) -> int: max_area = 0 stack = deque() for x in heights: ch = 1 while len(stack) > 0 and x < stack[-1][0]: v, h = stack.pop() max_area = max(max_area, v*(h+ch-1)) ch += h stack.append([x, ch]) th = 0 while len(stack) > 0: v, h = stack.pop() th += h max_area = max(max_area, v*th) return max_area

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
 

class Solution(object): def largestRectangleArea(self, heights): heights.append(0) stackk = [] res = 0 for i in range(len(heights)): index = i while stackk and stackk[-1][1] > heights[i]: (index,height) = stackk.pop() res = max(res,height * (i-index)) stackk.append((index,heights[i])) return res

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
 

文章来源: maoli.blog.csdn.net，作者：刘润森！，版权归原作者所有，如需转载，请联系作者。

原文链接：maoli.blog.csdn.net/article/details/90551218