1.在循环队列中设置一个标志flag,当front=rear且flag=0时为队空,当front=rear且flag=1时候队满,请编写相应的入队和出队算法(假设队头指针front指向对头元素的前一个位置,队尾指针rear指向队尾元素)
2.代码展示(复制可直接运行)
public class Y2019T9 { //队列 先进先出
static int SIZE=3;
public static int deQueue(CirQueue c) {//出队
if(c.front==c.rear&&c.flag==0){
System.out.println("队空");
return 0;
}
System.out.println("出队元素"+c.datarQueueSize[c.front]);
c.front=(c.front+1)%SIZE;
c.flag=0;
return 1;
}
public static void EnQueue(int x,CirQueue c){//入队
if(c.rear%SIZE==c.front&&c.flag==1){
System.out.println("队满");
}else{
System.out.println("入队元素"+x);
c.datarQueueSize[c.rear]=x;
c.rear=(c.rear+1)%SIZE;
System.out.println("============");
c.flag=1;
}
}
public static void main(String[] args){
CirQueue c=new CirQueue();
c.front=0;
c.rear=c.front;
c.flag=0;
EnQueue(3, c);
deQueue(c);
deQueue(c);
EnQueue(3, c);
EnQueue(4, c);
EnQueue(5, c);
EnQueue(5, c);
deQueue(c);
deQueue(c);
EnQueue(5, c);
deQueue(c);
deQueue(c);
deQueue(c);
deQueue(c);
}
}
class CirQueue{
int datarQueueSize[]=new int[3];
int front,rear;
int flag;
}