nihao.cpp

本程序中分别用数组和链表实现了环形队列

#include<iostream.h>
#include"lianbiao.h"
//#include"shuzu.h"

void main()
{
	char num;
	int temp;
	List A;
	do{
		cout<<"*********请选择服务********"<<endl;
		cout<<"1-创建新队列"<<endl;
		cout<<"2-增加到队列"<<endl;
		cout<<"3-删除对首元素"<<endl;
		cout<<"4-结束"<<endl;
		cout<<"***************************"<<endl;
		cin>>num;
		if(cin.eof())return;
		switch(num){
		case '1':
			A.enter();
			break;
		case '2':
			cout<<"请输入新加元素:  ";
			cin>>temp;
			A.addtoTail(temp);
			break;
		case '3':
			A.deleteHead();
			break;
		case '4':
			return;
		default:
			cout<<"输入错误！"<<endl;
			return;
		}
	}while(!cin.eof());		
}