从零开始的LC刷题(36)*: Min Stack 输出最小值的栈与其优化

原题：

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• getMin() -- Retrieve the minimum element in the stack.

 

Example:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin();   --> Returns -3.
minStack.pop();
minStack.top();      --> Returns 0.
minStack.getMin();   --> Returns -2.

 

就是编写一个栈的代码实现例子里的功能，先用链栈，结果：

Success

Runtime: 192 ms, faster than 5.27% of C++ online submissions for Min Stack.

Memory Usage: 17.1 MB, less than 16.38% of C++ online submissions for Min Stack.

代码：

class MinStack {
public:
    /** initialize your data structure here. */
    struct Stack{
        int val;
        Stack *next;
        Stack(int x):val(x),next(NULL){}
    };
    Stack *head=new Stack(INT_MAX);
    MinStack() {
        
    }
    
    void push(int x) {
        Stack *s=new Stack(x);
        s->next=head->next;
        head->next=s;
    }
    
    void pop() {
        Stack *s=head->next;
        head->next=s->next;
        delete(s);
    }
    
    int top() {
        return head->next->val;
    }
    
    int getMin() {
        int