剑指 Offer 30. 包含min函数的栈(c++/go)

c++:

class MinStack {
public:
    stack<int>stk;
    stack<int>min_stk;//存放最小值的栈
    /** initialize your data structure here. */
    MinStack() {
        min_stk.push(INT_MAX);
    }
    
    void push(int x) {
        stk.push(x);
        min_stk.push(::min(min_stk.top(),x));
    }
    
    void pop() {
        stk.pop();
        min_stk.pop();

    }
    
    int top() {
        return stk.top();

    }
    
    int min() {
        return min_stk.top();

    }
};

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack* obj = new MinStack();
 * obj->push(x);
 * obj->pop();
 * int param_3 = obj->top();
 * int param_4 = obj->min();
 */

go:

type MinStack struct {
    stack []int
    minStack []int
}


/** initialize your data structure here. */
func Constructor() MinStack {
    return MinStack{
        stack : []int{},
        minStack : []int{math.MaxInt64},
    }
}


func (this *MinStack) Push(x int)  {
    this.stack = append(this.stack,x)
    top := this.minStack[len(this.minStack)-1]
    this.minStack = append(this.minStack,min(top,x))
}


func (this *MinStack) Pop()  {
    this.stack = this.stack[:len(this.stack)-1]
    this.minStack = this.minStack[:len(this.minStack)-1]

}


func (this *MinStack) Top() int {
    return this.stack[len(this.stack)-1]

}


func (this *MinStack) Min() int {
    return this.minStack[len(this.minStack)-1]

}
func min(x,y int)int{
    if x > y{
        return y
    }else{
        return x
    }
}



/**
 * Your MinStack object will be instantiated and called as such:
 * obj := Constructor();
 * obj.Push(x);
 * obj.Pop();
 * param_3 := obj.Top();
 * param_4 := obj.Min();
 */