【LeetCode】(C#)155. Min Stack(Easy)

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.

public class MinStack {

    /** initialize your data structure here. */
    List<int> stack = null;
    int Min;
    public MinStack() {
         stack = new List<int>();
    }
    
    public void Push(int x)
    {
        stack.Add(x);
    }

    public void Pop()
    {
        stack.RemoveAt(stack.Count - 1);
    }

    public int Top()
    {
            if (stack.Count > 0)
            {
                return stack[stack.Count - 1];
            }
            else
                return 0;

    }

    public int GetMin()
    {

        if(stack.Count>0)
        {
            Min = stack[0];
            foreach (int i in stack)
            {
                if (i < Min)
                    Min = i;
            }
        }
        return Min;
    }
}

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