aaaqqq1234的博客

class Solution: stack1 = [] stack2 = [] def push(self, node): self.stack1.append(node) def pop(self): if len(self.stack2) == 0: for i in range(len(self.stack1)): val = self.stack1.pop()

题目 输入: [2,1,5,6,2,3] 输出: 10 思路 单调栈 代码 def largestRectangleArea(heights): max_ans = 0 heights = [0]+heights +[0] length = len(heights) stack = [0] for i in range(1,length): while heights[i]<heights[stack[-1]]: h =

题目 队列 class Arrayqueue: default_capacity = 3 def __init__(self): self.data = [None]*Arrayqueue.default_capacity self.size = 0 self.head = 0 def __len__(): return self.size def is_empty(self): return self.size == 0 def extenti

题目 栈 class ArrayStack: def __init__(self): self.data = [] def len(self): return len(self.data) def is_empty(self): return len(self.data) == 0 def push(self,a): self.data.append(a) def top(self): if self.is_empty(): r