#include <bits/stdc++.h>
#define maxsize 200005
#define addsize 100
#define true 1
#define false 0
typedef int elemtype;
typedef struct qnode{
elemtype data;
struct qnode *next;
}qnode,*queuenode;
typedef struct
{
queuenode front;
queuenode rear;
int queuelength;
}queue;
//
typedef struct
{
elemtype *base;
elemtype *top;
elemtype *p;
int stacksize;
}sqstack;
//队列的定义
void initqueue(queue &q)
{
q.front=new qnode;
q.rear=q.front;
q.front->next=NULL;
q.queuelength=0;
}
void clearqueue(queue &q)
{
while(q.front)
{
q.rear=q.front->next;
free(q.front);
q.front=q.rear;
}
}
void enqueue(queue &q,elemtype e)
{
queuenode p;
p= new qnode;
p->data=e;
p->next=NULL;
q.rear->next=p;
q.rear=p;
q.queuelength++;
}
void enqueue1(queue &q,elemtype e)
{
queuenode p;
p= new qnode;
p->data=e;
p->next=NULL;
q.front
q.rear->next=p;
q.rear=p;
q.queuelength++;
}
void dequeue(queue &q) // 删除队列第一个元素
{
if(q.front==q.rear) return;
queuenode p;
p=q.front->next;
q.front->next=p->next;
if(q.rear==p)
{
q.rear=q.front;
}
free(p);
q.queuelength--;
}
int queuempty(queue &q)
{
if(q.rear==q.front)
{
return true;
}
else
{
return false;
}
}
int query(queue &q,elemtype x)
{
queuenode p;
p=q.front;
while(x--)
{
p=p->next;
}
return p->data;
}
void delqueue(queue &q,elemtype x)// 删除队列前x个元素
{
queuenode p;
q.queuelength=q.queuelength-x;
while(x--)
{
p=q.front->next;
q.front->next=p->next;
}
free(p);
}
void leave(queue &q,elemtype x)
{
queuenode p;
p=q.front;
while(x!=1)
{
p=p->next;
x--;
}
p->next=p->next->next;
q.queuelength--;
}
//栈的定义
elemtype initstack(sqstack &s)
{
s.base=new elemtype[maxsize];
if(!s.base)
{
return false;
}
s.top=s.base;
s.p=s.base;
s.stacksize=maxsize;
return true;
}
void push(sqstack &s,elemtype x)
{
if(s.top-s.base>s.stacksize)
{
s.base=new elemtype[s.stacksize+addsize];
s.top=s.base+addsize;
s.stacksize+=addsize;
}
*s.top=x;
s.top++;
}
elemtype pop(sqstack &s)
{
if(s.top==s.base)
{
return false;
}
elemtype x;
s.top--;
x=*s.top;
return x;
}
elemtype gettop(sqstack &s)
{
return *(s.top-1);
}
elemtype isempty(sqstack &s)
{
if(s.top==s.base)
{
return true;
}
else
{
return false;
}
}
elemtype isfull(sqstack &s)
{
if(s.top-s.base>=s.stacksize)
{
return true;
}
else
{
return false;
}
}
int main()
{
int m,key,k,i,t;
char a[10];
queue q;
initqueue(q);
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&k);
enqueue(q,k);
}
scanf("%d",&t);
while(t--)
{
scanf("%s",a);
if(strcmp(a,"JOIN")==0)
{
scanf("%d",&key);
enqueue(q,key);
}
else if(strcmp(a,"ASK")==0)
{
scanf("%d",&key);
printf("%d\n",query(q,key));
}
else if(strcmp(a,"FINISH")==0)
{
scanf("%d",&key);
delqueue(q,key);
}
else if(strcmp(a,"LENGTH")==0)
{
printf("%d\n",q.queuelength);
}
else if(strcmp(a,"LEAVE")==0)
{
scanf("%d",&key);
leave(q,key);
}
}
return 0;
}
数据结构实验之队列一:排队买饭
最新推荐文章于 2022-03-03 15:34:28 发布