Leetcode 155. Min Stack
来源:互联网 发布:java web 前后端分离 编辑:程序博客网 时间:2024/06/05 06:35
Using two stacks, one to save elements, and the other to save the minimum. Therefore, there is a mapping between an element and current minimum.
stack min
-1 -1
4 1
3 1
2 1
1 1
for sequence 1 2 3 4 -1.
public class MinStack { Stack<Integer> s; Stack<Integer> min; /** initialize your data structure here. */ public MinStack() { s = new Stack<>(); min = new Stack<>(); } public void push(int x) { s.push(x); if (min.isEmpty()) { min.push(x); } else { min.push(Math.min(x, min.peek())); } } public void pop() { if (!s.isEmpty() && !min.isEmpty()) { s.pop(); min.pop(); } } public int top() { return s.peek(); } public int getMin() { return min.peek(); }}
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
- 内容提供者(ContentProvider)---获取联系人
- Atitit 单项功能开发 最佳实践规范 标准化流程attilax总结.docx
- Atitit orm优缺点 Hinaernate mybatis 区别。attilax总结
- Atitit Atitit 客户常见技术问题的解答.docx
- Android中内容观察者的使用---- ContentObserver类详解
- Leetcode 155. Min Stack
- 【数据结构与算法】最长公共子串 最长公共子序列
- 知识管理精进指南读书笔记
- 用JS获取地址栏参数的方法(超级简单)
- 数据结构-数组
- HAProxy的三种不同类型配置方案
- 算法提高 统计单词数
- C++11心得笔记
- 220. Contains Duplicate III