[Leetcode]155. Min Stack
来源:互联网 发布:复制淘宝口令没反应 编辑:程序博客网 时间:2024/05/16 08:20
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
- push(x) -- Push element x onto stack.
- pop() -- Removes the element on top of the stack.
- top() -- Get the top element.
- getMin() -- Retrieve the minimum element in the stack.
Example:
MinStack minStack = new MinStack();minStack.push(-2);minStack.push(0);minStack.push(-3);minStack.getMin(); --> Returns -3.minStack.pop();minStack.top(); --> Returns 0.minStack.getMin(); --> Returns -2.
class MinStack {public: /** initialize your data structure here. */ stack<int> stk; stack<int> minstk; MinStack(){ } void push(int x) { stk.push(x); if (minstk.empty() || minstk.top() >= x) minstk.push(x); } void pop() { if (stk.top() == minstk.top()) { stk.pop(); minstk.pop(); } else stk.pop(); } int top() { return stk.top(); } int getMin() { return minstk.top(); } };/** * Your MinStack object will be instantiated and called as such: * MinStack obj = new MinStack(); * obj.push(x); * obj.pop(); * int param_3 = obj.top(); * int param_4 = obj.getMin(); */
0 0
- LeetCode 155. Min Stack
- 【LeetCode】155.Min Stack
- LeetCode 155.Min Stack
- [leetcode] 155.Min Stack
- [leetcode] 155.Min Stack
- Leetcode 155. Min Stack
- 155. Min Stack LeetCode
- [LeetCode]155. Min Stack
- LeetCode *** 155. Min Stack
- 【leetcode】155. Min Stack
- LeetCode 155. Min Stack
- leetcode-155. Min Stack
- LeetCode-155.Min Stack
- LeetCode - 155. Min Stack
- [Leetcode]155. Min Stack
- 【leetcode】155. Min Stack
- LeetCode 155. Min Stack
- [leetcode] 155. Min Stack
- cocos2d 导入extensions
- Lua自己实现如果对象是指定类或其子类的实例,返回 true
- 近期小结
- android 数据库升级(保留原先数据)
- Git 常用操作
- [Leetcode]155. Min Stack
- VR虚拟现实&AR增强现实编程(1):VR和AR简介
- java线程(一):线程创建与线程状态
- 数据库编程细节问题 -- 5.group by 的使用
- linux内核栈与用户栈及调用栈观察方法
- Hanoi in Prolog
- C++标准库类型——string
- JAVA并发集合学习总结
- SpringMVC请求后台地址URL没有.*的几种实现方式