6.顺序循环队列

来源：互联网发布：淘宝柯巴编辑：程序博客网时间：2024/05/16 07:25

package sequenceQueue;//队列接口public interface Queue {  //入队  public void append(Object obj) throws Exception;  //出队  public Object delete() throws Exception;  //获得队头元素  public Object getFront() throws Exception;  //判断对列是否为空  public boolean isEmpty();}

package sequenceQueue;//循环顺序队列public class CircleSequenceQueue implements Queue {    static final int defaultSize = 10; //默认队列的长度    int front;  //队头    int rear;   //队尾    int count;  //统计元素个数的计数器    int maxSize; //队的最大长度    Object[] queue;  //队列    public CircleSequenceQueue() {        init(defaultSize);    }    public CircleSequenceQueue(int size) {        init(size);    }    public void init(int size) {        maxSize = size;        front = rear = 0;        count = 0;        queue = new Object[size];    }    @Override    public void append(Object obj) throws Exception {        // TODO Auto-generated method stub        if (count > 0 && front == rear) {            throw new Exception("队列已满！");        }        queue[rear] = obj;        rear = (rear + 1) % maxSize;        count++;    }    @Override    public Object delete() throws Exception {        // TODO Auto-generated method stub        if (isEmpty()) {            throw new Exception("队列为空！");        }        Object obj = queue[front];        front = (front + 1) % maxSize;        count--;        return obj;    }    @Override    public Object getFront() throws Exception {        // TODO Auto-generated method stub        if (!isEmpty()) {            return queue[front];        } else {            return null;        }    }    @Override    public boolean isEmpty() {        // TODO Auto-generated method stub        return count == 0;    }}

阅读全文

0 0