// 鏈式堆棧的測試linearStack2m.cpp
#include<iostream.h>
#include<iomanip.h>
typedef int ElemType;
#include "linearStack2.cpp"
void main()
{cout<<"linearStack2m.cpp運行結果:\n";
 int m,n;
 LinStack q,p,w;
 cout<<"輸入產(chǎn)生隨機數(shù)的種子數(shù)n:";cin>>n;
 cout<<"輸入欲構造棧q的長度m:";cin>>m;
 cout<<"創(chuàng)建棧q(升序):\n";
 q.CreateStack(n,m,1);
 cout<<"q棧的結點個數(shù)="<<q.StackSize()<<endl;
 cout<<"輸出q棧元素:\n";
 q.StackPrint(m);cout<<endl;
 cout<<"q棧:";
 if(q.StackFull(m)==1)
  cout<<"已滿!\n";
 else cout<<"未滿!\n";
 cout<<"創(chuàng)建棧p(降序):\n";
 p.CreateStack(n+10,m,-1);
 cout<<"p棧:";
 if(p.StackFull(m)==1)
  cout<<"已滿!\n";
 else cout<<"未滿!\n";
 cout<<"刪除元素為:"<<p.Pop()<<endl;
 cout<<"p棧:";
 if(p.StackEmpty()==1)
  cout<<"為空!\n";
 else cout<<"為非空!\n";
 cout<<"輸出p棧元素:\n";
 p.StackPrint(m-1);cout<<endl;
 cout<<"創(chuàng)建棧w(無序):\n";
 w.CreateStack(2*n,m);
 cout<<"輸出w棧元素:\n";
 w.StackPrint(m);cout<<endl;
 p.ClearStack();
 p.DeleteStack();
 cin.get();cin.get();}