每日一题--LeetCode 155最小栈

解法一：使用辅助栈存储最小元素

class MinStack{
    stack<int> x_stack;
    stack<int> min_stack;
public:
    MinStack(){
        min_stack.push(INT_MAX);
    }
    void push(int val){
        x_stack.push(val);
        min_stack.push(min(min_stack.top(),val));
    }
    void pop(){
        x_stack.pop();
        min_stack.pop();
    }
    int top(){
        return x_stack.top();
    }
    int getmin(){
        return min_stack.top();
    }
};

解法二：自定义Stack

以单链表的形式定义栈，链表节点定义及自定义Stack定义如下：

class Node{
    int val;
    int min;
    Node* next;
public:
    Node(int val,int min):val(val),min(min),next(null){}
    Node(int val,int min,Node* next):val(val),min(min),next(next){}
};
class MinStack{
    NOde* head;
    MinStack(){}
    void push(int x){
        if(head==null){
            head=new Node(x,x);
        }else{
            head=new Node(x,min(x,head,min),head);
        }
    }
    void pop(){
        head=head.next;
    }
    int top(){
        return head.val;
    }
    int getmin(){
        return head.min;
    }
};