// 鏈式堆棧的實現linearStack2.cpp
#include "linearStack2.h"
#include<stdlib.h>
//構造函數
 LinStack::LinStack()
 {top=NULL;size=0;}
//初始化棧,分配存儲空間并置空
  void LinStack::InitStack(int L)
 {top=new StackNode[L];
  size=0;
 }
//創建有序或無序棧
 void LinStack::CreateStack(int n,int m,int mark)
 {ElemType x,a[LEN/2];
  srand(n);
  for(int i=0;i<m;i++) a[i]=rand()%100;
  for(i=0;i<m-1;i++)
  {int k=i;
   for(int j=i+1;j<m;j++)
    if(a[k]>a[j]) k=j;
   if(k!=i)
   {x=a[k];a[k]=a[i];a[i]=x;}}
  for(i=0;i<m;i++)
  if(mark==1) Push(a[m-1-i]);//升序
  else
   if(mark==-1) Push(a[i]);//降序
   else Push(rand()%100);//無序
 }
 int LinStack::StackSize()
 {return size;}
//清空棧
 void LinStack::ClearStack() {size=0;}
//刪除棧
 void LinStack::DeleteStack()
 {delete top;}
//檢查棧是否為空
 bool LinStack::StackEmpty() {return size==0;}
//讀取棧頂元素
 ElemType LinStack::Peek()
 { return top->data;}
//向棧中插入元素
 void LinStack::Push(const ElemType& item)
 {StackNode *newNode=new StackNode;
  newNode->data=item;newNode->next=top;
  top=newNode;
  size++;
 }
//從棧中刪除元素
 ElemType LinStack::Pop()
 {if(size==0) {
   cerr<<"棧為空!"<<endl;exit(1);}
   StackNode *p=top->next;
   ElemType data=top->data;
   delete top;
   size--;
   top=p;
   return data;
 }
//檢查棧是否已滿
 bool LinStack::StackFull(ElemType m)
 {return size==m;}
//棧的輸出
 void LinStack::StackPrint(ElemType m)
 {for(int i=0;i<m;i++)
   cout<<setw(3)<<Pop();
 }