最小栈

 

设计一个支持 push，pop，top 操作，并能在常数时间内检索到最小元素的栈。

• push(x) -- 将元素 x 推入栈中。
• pop() -- 删除栈顶的元素。
• top() -- 获取栈顶元素。
• getMin() -- 检索栈中的最小元素。

示例:

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

 使用栈，，，入栈时，判断minStack是否为空及与其栈顶元素大小关系，进行比较入栈

                     出栈时，与minStack栈顶比较，若相等，都出栈

https://baijiahao.baidu.com/s?id=1572074746858895&wfr=spider&for=pc

public class MinStack {
    private Stack<int>stack;
    private Stack<int>minStack;
    /** initialize your data structure here. */
    public MinStack() {
        stack=new Stack<int>();
        minStack=new Stack<int>();
    }
    
    public void Push(int x) {
        stack.Push(x);
        if(minStack.Count==0||minStack.Peek()>=x)
            minStack.Push(x);
    }
    
    public void Pop() {
        if(stack.Peek().Equals(minStack.Peek()))
            minStack.Pop();
        stack.Pop();
    }
    
    public int Top() {
        return stack.Peek();
    }
    
    public int GetMin() {
        return minStack.Peek();
    }
}

/**
 * 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.GetMin();
 */

 使用List

public class MinStack {

    public List<int> list ;
        public List<int> MinList;

        /** initialize your data structure here. */
        public MinStack()
        {
            list = new List<int>();
            MinList = new List<int>();
        }

        public void Push(int x)
        {
            if (list.Count == 0)
                MinList.Add(x);
            else
                if (MinList.Last() >= x)
                    MinList.Add(x);
            list.Add(x);
        }

        public void Pop()
        {
            if (MinList.Last() == list.Last())
            {
                MinList.RemoveAt(MinList.Count - 1);
            }
            list.RemoveAt(list.Count - 1);
        }

        public int Top()
        {
            return list.Last();
        }

        public int GetMin()
        {
            return MinList.Last();
        }
}

/**
 * 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.GetMin();
 */