目录

力扣716. 最大栈

力扣716. Max Stack(最大栈)

设计支持查找最大值的栈。会员题。

示例 1:

../posts/01_学习/87_LeetCode/0716_最大栈/img/0716-1-description.png

输入:["MaxStack","push","push","push","top","popMax","top","peekMax","pop","top"]
     [[],[5],[1],[5],[],[],[],[],[],[]]
输出:[null,null,null,null,5,5,1,5,1,5]
解释:...

提示:

  • -10^7 <= x <= 10^7
  • 最多调用 10^4 次操作