最小栈

最小栈

题目如下

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