package com.ltl.test;
public interface MyQueue {
public boolean isEmpty();
public boolean isFull();
public void add(int num);
public int delete();
public void show();
public int count();
}
package com.ltl.test;
public class Queue implements MyQueue {
private int maxsize;
private int front;
private int rear;
private int[] array;
public Queue(int size) {
maxsize=size;
array=new int[maxsize];
front=0;
rear=0;
}
@Override
public boolean isEmpty() {
// TODO Auto-generated method stub
return front==rear;
}
@Override
public boolean isFull() {
// TODO Auto-generated method stub
return (rear+1) % maxsize == front;
}
@Override
public void add(int num) {
if(isFull()) {
System.out.println("队列已满");
}
array[front]=num;
rear=(rear+1)%maxsize;
}
@Override
public int delete() {
// TODO Auto-generated method stub
if(isEmpty()) {
System.out.println("队列为空");
}
int value=array[front];
front=(front+1)%maxsize;
return value;
}
@Override
public void show() {
if(isEmpty()) {
System.out.println("队列为空");
}
for (int i = front; i < front+count(); i++) {
System.out.printf("array[%d]=%d\n",i % maxsize,array[i%maxsize]);
}
}
@Override
public int count() {
// TODO Auto-generated method stub
return (rear-front+maxsize) % maxsize;
}
}
package com.ltl.test;public interface MyQueue { public boolean isEmpty(); public boolean isFull(); public void add(int num); public int delete(); public void show(); public int count();}package com.ltl.test;public class Queue implements My.