首页 > 代码库 > [LintCode] Min Stack 最小栈
[LintCode] Min Stack 最小栈
Implement a stack with min() function, which will return the smallest number in the stack.
It should support push, pop and min operation all in O(1) cost.
Notice
min operation will never be called if there is no number in the stack.
Have you met this question in a real interview?
Yes
Example
push(1)pop() // return 1push(2)push(3)min() // return 2push(1)min() // return 1
LeetCode上的原题，请参见我之前的博客Min Stack.
解法一：
class MinStack {public: MinStack() {} void push(int number) { m1.push(number); if (m2.empty() || m2.top() >= number) { m2.push(number); } } int pop() { if (m1.empty()) return -1; int t = m1.top(); m1.pop(); if (!m2.empty() && m2.top() == t) m2.pop(); return t; } int min() { if (!m2.empty()) return m2.top(); return -1; }private: stack<int> m1, m2;};
解法二：
class MinStack {public: MinStack():mn(INT_MAX) {} void push(int number) { if (number <= mn) { s.push(mn); mn = number; } s.push(number); } int pop() { int t = s.top(); s.pop(); if (t == mn) { mn = s.top(); s.pop(); } return t; } int min() { return mn; }private: int mn; stack<int> s;};
[LintCode] Min Stack 最小栈
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。