- 面向对象上机考试题—关于队列
- 发布日期时间:2007-1-14 来源:网络 点击数: 作者:佚名
> cout<<" 队列的头元素为";
Elm[0]->ShowMe();
}
}
void del()
{
if(empty()) cout<<"队列为空"<<endl;
else{
cout<<" 出队列的元素为";
Elm[size--]->ShowMe();
}
}
bool empty()
{
return (bool)(size==-1);
}
bool full()
{
return (bool)(size==max-1);
}
};
void main()
{ MyInteger my1;
MyString my2;
Queue queue;
int s=1;
while(s)
{
cout<<"Please select 1-6 "<<endl;
cout<<" 1: 整数进队列;"<<endl;
cout<<" 2: 字符串进队列;"<<endl;
cout<<" 3: 显示队列头元素;"<<endl;
cout<<" 4: 显示队列尾元素"<<endl;
cout<<" 5: 出队列;"<<endl;
cout<<" 6: 退出程序"<<endl;
cout<<"--------------------------------------"<<endl;
cout<<"请选择您的*作:";
cin>>s;
switch(s)
{
case 1: cin>>my1; queue.add(my1); break;
case 2: cin>>my2; queue.add(my2); break;
case 3: queue.head(); break;
case 4: queue.tail(); break;
case 5: queue.del(); break;
default: s=0; break;
}
}
} 北京自考热
Elm[0]->ShowMe();
}
}
void del()
{
if(empty()) cout<<"队列为空"<<endl;
else{
cout<<" 出队列的元素为";
Elm[size--]->ShowMe();
}
}
bool empty()
{
return (bool)(size==-1);
}
bool full()
{
return (bool)(size==max-1);
}
};
void main()
{ MyInteger my1;
MyString my2;
Queue queue;
int s=1;
while(s)
{
cout<<"Please select 1-6 "<<endl;
cout<<" 1: 整数进队列;"<<endl;
cout<<" 2: 字符串进队列;"<<endl;
cout<<" 3: 显示队列头元素;"<<endl;
cout<<" 4: 显示队列尾元素"<<endl;
cout<<" 5: 出队列;"<<endl;
cout<<" 6: 退出程序"<<endl;
cout<<"--------------------------------------"<<endl;
cout<<"请选择您的*作:";
cin>>s;
switch(s)
{
case 1: cin>>my1; queue.add(my1); break;
case 2: cin>>my2; queue.add(my2); break;
case 3: queue.head(); break;
case 4: queue.tail(); break;
case 5: queue.del(); break;
default: s=0; break;
}
}
} 北京自考热
文章转载请注明来源于:汕头自考网
网友评论
|
|



