【LeetCode-Java】155. Min Stack
来源:互联网 发布:md5算法 编辑:程序博客网 时间:2024/06/11 03:46
1.原题
链接:https://leetcode.com/problems/min-stack/
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.
2.题目大意
定义栈的数据结构,实现一个能够得到栈的最小元素的min函数。在该栈中,调用min、push及pop的时间复杂度都是O(1)
3.解题思路
为了能在O(1)时间内得到最小元素,需要有辅助的栈,保存当前的最小值,记为最小栈。这个辅助的栈,需在push(),pop()操作时更新,push时若当前最小栈为空或入栈的值<=最小栈栈顶的值,则将当前入栈的值压入最小栈;pop时,若出栈的值和最小栈栈顶的值相同,则最小栈也pop。
4.代码实现
public class MinStack {
ArrayList<Integer> stack=new ArrayList<>();
ArrayList<Integer> minStack=new ArrayList<>();
public void push(int x) {
stack.add(x);
if(minStack.isEmpty() || minStack.get(minStack.size()-1)>=x)
minStack.add(x);
}
public void pop() {
if(stack.isEmpty())
return;
int last=stack.remove(stack.size()-1);
if(!minStack.isEmpty() && minStack.get(minStack.size()-1)==last)
minStack.remove(minStack.size()-1);
}
public int top() {
if(stack.isEmpty())
return 0;
return stack.get(stack.size()-1);
}
public int getMin() {
if(minStack.isEmpty())
return 0;
return minStack.get(minStack.size()-1);
}
}
- 【LeetCode-Java】155. Min Stack
- Leetcode [Min Stack] java
- LeetCode|Min Stack-java
- 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
- 搭建Maven私服
- Ubuntu14.04下MXNet安装
- IOCP之accept、AcceptEx、WSAAccept的区别
- iOS开发 iOS10推送必看(基础篇)
- 448. Find All Numbers Disappeared in an Array
- 【LeetCode-Java】155. Min Stack
- Omi原理-Hello Omi
- leecode 解题总结:107. Binary Tree Level Order Traversal II
- 引擎开发_ 碰撞检测_GJK 算法详细介绍
- 虚拟机linux系统设置静态ip无法联网
- cocos2d-x + lua获取CocoStudio中导入json文件中控件的两种方法:
- webstrom scss(sass)配置
- 关于如何在svn下载到本地,然后将maven父结构中的子模块导出
- hadoop HDFS操作类