一、题目描述
定义栈的数据结构,请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中,调用 min、push 及 pop 的时间复杂度都是 O(1)。
二、代码
class MinStack() {
/** initialize your data structure here. */
val stack = Stack<Int>()
var minstack = Stack<Int>()
fun push(x: Int) {
if(minstack.size == 0 || minstack.peek() >= x)
minstack.push(x)
stack.push(x)
}
fun pop() {
if(minstack.peek() == stack.peek())
minstack.pop()
stack.pop()
}
fun top(): Int {
return stack.peek()
}
fun min(): Int {
return minstack.peek()
}
}
/**
* Your MinStack object will be instantiated and called as such:
* var obj = MinStack()
* obj.push(x)
* obj.pop()
* var param_3 = obj.top()
* var param_4 = obj.min()
*/