89 lines
2.1 KiB
C++
89 lines
2.1 KiB
C++
#include<iostream> //cout,cin
|
|
using namespace std;
|
|
#include "LinkStack.h"
|
|
|
|
|
|
void dispmenu()
|
|
{//显示主菜单
|
|
cout<<endl;
|
|
cout<<"1-初始化链栈\n";
|
|
cout<<"2-元素入栈\n";
|
|
cout<<"3-元素出栈\n";
|
|
cout<<"4-取栈顶元素\n";
|
|
cout<<"5-测栈空\n";
|
|
cout<<"6-显示栈元素\n";
|
|
cout<<"7-退出\n";
|
|
}
|
|
|
|
char pause;
|
|
|
|
//主函数
|
|
int main()
|
|
{
|
|
int e;
|
|
LNode<int> * S;
|
|
system("cls"); // 清屏
|
|
int choice;
|
|
do
|
|
{
|
|
dispmenu(); //显示主菜单
|
|
cout<<"Enter choice(1~7):";
|
|
cin>>choice;
|
|
switch(choice)
|
|
{
|
|
case 1: //初始化链栈
|
|
InitStack(S);
|
|
cout<<endl<<"创建成功！"<<endl;
|
|
break;
|
|
case 2: //入栈
|
|
cout<<"输入要插入的元素值："<<endl;
|
|
cin>>e;
|
|
cout<<endl;
|
|
if(Push(S,e))
|
|
cout<<endl<<"入栈成功！"<<endl;
|
|
else
|
|
cout<<endl<<"入栈不成功！"<<endl;
|
|
break;
|
|
|
|
case 3: //出栈
|
|
if(Pop(S,e))
|
|
{
|
|
cout<<endl<<"出栈元素为:"<<e<<endl;
|
|
cout<<endl<<"出栈成功！"<<endl;
|
|
}
|
|
else
|
|
cout<<endl<<"栈空，出栈失败！"<<endl;
|
|
break;
|
|
|
|
case 4: //获取栈顶元素
|
|
if(GetTop(S,e))
|
|
{
|
|
cout<<endl<<"栈顶元素为:"<<e<<endl;
|
|
}
|
|
else
|
|
cout<<endl<<"栈空！"<<endl;
|
|
break;
|
|
case 5: //测栈空
|
|
if(StackEmpty(S))
|
|
cout<<endl<<"空栈！"<<endl;
|
|
else
|
|
cout<<endl<<"不是空栈！"<<endl;
|
|
break;
|
|
case 6: //显示栈元素
|
|
DispStack(S);
|
|
cout<<endl;
|
|
cin.get(pause);
|
|
system("pause");
|
|
break;
|
|
case 7: //退出
|
|
DestroyStack(S);
|
|
cout<<"结束运行"<<endl;
|
|
break;
|
|
default: //非法选择
|
|
cout<<"Invalid choice\n";
|
|
break;
|
|
}
|
|
}while(choice!=7);
|
|
return 0;
|
|
}//end of main function
|