typedef struct lst_stack_number
{
  int data;
  struct lst_stack_number *next;
}LST_STACK_NUMBER;
LST_STACK_NUMBER*top=NULL;    void push(int n)
{
  LST_STACK_NUMBER *p;
  p=(LST_STACK_NUMBER*)malloc(sizeof(LST_STACK_NUMBER));
  p->data=N;
  p->next=top;
  top=p;
}    int empty()  //判別堆疊是否空的
{
  if(top==NULL)
    return(1);
  else
    return(0);
}    int pop()
{
  LST_STACK_NUMBER*p;
  int n;
  if(!empty())
  {
    p=top;
    top=top->next;
    n=p->data;
    free(p);
    return(n);
  }
  else
  {
    ShowMessage("堆疊已經空了");
    exit(1);
  }
}