//順序堆棧的測(cè)試linearStack1m.cpp
#include<iostream.h>
#include<iomanip.h>
typedef int ElemType;
#include "linearStack1.cpp"
void main()
{cout<<"linearStack1m.cpp運(yùn)行結(jié)果:\n";
 int m=10,n=120;
 Stack q,p,w;
 q.CreateStack(n,m,1);
 cout<<"\n輸出q棧元素(升序):\n";
 q.StackPrint(m);cout<<endl;
 cout<<"q棧:";
 if(q.StackFull(m)==1)
  cout<<"已滿(mǎn)!\n";
 else cout<<"未滿(mǎn)!\n";
 cout<<"創(chuàng)建棧p(降序):\n";
 p.CreateStack(n+10,m,-1);
 cout<<"p棧:";
 if(p.StackFull(m)==1)
  cout<<"已滿(mǎn)!\n";
 else cout<<"未滿(mǎn)!\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(無(wú)序):\n";
 w.CreateStack(2*n,m);
 cout<<"輸出w棧元素:\n";
 w.StackPrint(m);cout<<endl;
 p.ClearStack();
 cin.get();cin.get();}