开始刷leetcode day8 : Min Stack
来源:互联网 发布:mac 打谱 编辑:程序博客网 时间:2024/06/05 06:06
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.
Java:
class MinStack {
ArrayList<Integer> stack = new ArrayList<Integer>();
ArrayList<Integer> minstack = new ArrayList<Integer>();
public void push(int x) {
if(minstack.size() == 0|| minstack.get(minstack.size()-1) >= x)
{
minstack.add(x);
}
stack.add(x);
}
public void pop() {
int n = stack.get(stack.size()-1);
if(minstack.size() >0 && n== minstack.get(minstack.size()-1))
{ minstack.remove(minstack.size() - 1);}
stack.remove(stack.size()-1);
}
public int top() {
return stack.get(stack.size()-1);
}
public int getMin() {
if( minstack.size() > 0)
return minstack.get(minstack.size() -1);
return 0;
}
}
- 开始刷leetcode day8 : Min Stack
- 开始刷题leetcode day8: Min Stack
- LeetCode[stack]: Min Stack
- [leetcode][stack] Min Stack
- 【Leetcode】Min Stack
- Leetcode: Min Stack
- leetcode Min stack
- Min Stack -- LeetCode
- Leetcode: Min Stack
- 【LeetCode】Min Stack
- leetcode Min Stack
- leetcode--Min Stack
- [Leetcode]Min stack
- leetcode:Min Stack
- leetcode 之 Min Stack
- leetcode Min Stack
- LeetCode(155) Min Stack
- [LeetCode]Min Stack
- MongDB 启动警告 WARNING: soft rlimits too low
- linux 中的.so和.a文件
- 如何将DataGridView转换为DataTable?
- DWR的AJAX之DWRUtil.addOptions
- 算法笔记-DTW动态时间规整
- 开始刷leetcode day8 : Min Stack
- 开始刷题leetcode day8: Min Stack
- 开始刷题 leetcode day8: Minimum Depth of Binary Tree
- linux cat命令
- 黑马程序员——Foundation学习之NSArray\NSMutableArray
- 第四章习题
- 老菜鸟致青春,程序员应该选择java 还是 c#-
- 读取配置文件csv的接口封装类
- 数据库的1NF,2NF和3NF的区别