wq1-4.cpp

各种算法的c语言程序

#include"DbStack.cpp"

void test(char ans)
{
//测试函数
int n,len;
TYPE ele;
	if(ans=='q'){
		cout<<"谢谢使用本测试系统！"<<endl;
		return;
	}
	if(ans<'1'||ans>'6'){
		cout<<"错误：输入数据无效，请再试一次！"<<endl;
		return;
	}
	switch(ans){
	case '1':
		InitStack(&SqStack);
		break;
	case '2':
		if(!SqStack.elem){
		   cout<<"双向栈未初始化！"<<endl;
		   return;
		   }
		cout<<"请输入栈的序号:(1 or 2)"<<endl;
		cin>>n;
		cout<<"请输入一个元素:"<<endl;
		cin>>ele;
		Push(&SqStack,n,ele);
		break;
	case '3':
		if(!SqStack.elem){
		   cout<<"双向栈未初始化！"<<endl;
		   return;
		   }
		cout<<"请输入栈的序号:(1 or 2)"<<endl;
		cin>>n;
		Pop(&SqStack,n,&ele);
		break;
	case '4':
		DestroyStack(&SqStack);
		break;
	case '5':
		if(!SqStack.elem){
		   cout<<"双向栈未初始化！"<<endl;
		   return;
		   }
		cout<<"请输入栈的序号:(1 or 2)"<<endl;
		cin>>n;
		StackDisplay(SqStack,n);
		break;
	case '6':
		if(!SqStack.elem){
		   cout<<"双向栈未初始化！"<<endl;
		   return;
		   }
		cout<<"请输入栈的序号:(1 or 2)"<<endl;
		cin>>n;
		if((len=GetLength(SqStack,n))!=-1)
		   cout<<"栈"<<n<<" 的长度是 "<<len<<endl;
		break;
	}//switch

}//test

int main()
{
//主函数
	char ans;
	do{
		cout<<"请输入您的选择:"<<endl;
		cout<<"1- 初始化一个双向栈"<<endl;
		cout<<"2-新元素进栈"<<endl;
		cout<<"3- 删除栈顶元素"<<endl;
		cout<<"4- 销毁双向栈"<<endl;
		cout<<"5- 显示双向栈"<<endl;
		cout<<"6- 显示栈的当前长度"<<endl;
		cout<<"q- 退出"<<endl;

		ans=getchar();
		getchar();
		test(ans);
	  }while(ans!='q');


	getch();
	return OK;
}