Java用数组实现顺序队列


public class Queue {

    private static final int MAX_SIZE = 100;
    private Object[] queue;
    private int length;     //队列初始化长度
    private int front;      //Head pointers
    private int rear;       //The tail pointer

    //Initialize the queue
    private void init(){
        queue = new Object[this.length + 1];
        front = rear = 0;
    }

    //Team
    public void put(Object object)throws Exception{
        if (isFull()) {
            throw new Exception("team faild,queue is empty!");
        }
        queue[rear] = object;
        rear = (rear + 1) % queue.length;
    }

    //Out team
    public Object get() throws Exception{
        if (isEmpey()) {
            throw new Exception("Out team faild,queue is empty");
        }
        Object object = queue[front];
        queue[front] = null;    //Releasiong objects.
        front = (front + 1) % queue.length;
        return object;
    }

    //Clear team
    public void clear(){
        queue = null;
        queue = new Object[this.length];
    }

    //get the current queue size
    public int size(){
        return (rear - front + queue.length) % queue.length;
    }

    //Determines whether the queue is empty
    private boolean isEmpey() {
        // TODO Auto-generated method stub
        return front == rear;
    }

    /**
     * Determines wheter the queue is full
     * @return
     */
    private boolean isFull() {
        // TODO Auto-generated method stub

        return (rear + 1) % queue.length == front;
    }

    public Queue(int length){
        this.length = length;
        init();
    }

    public Queue(){
        this.length = MAX_SIZE;
        init();
    }
    public static void main(String []args){
        System.out.println("ceshi");
        Queue queue = new Queue(5);
        char[] data = new char[]{'凔','海','一','声','笑'};
        try {
            for (int i = 0; i < data.length; i++) {
                System.err.println("Team data:" + data[i]);
                    queue.put(data[i]);
            }
            System.out.println("Team size:" + queue.size());
            System.out.println("-------------------------");
            while (!queue.isEmpey()) {
                System.out.println("Out data:" + queue.get());
            }
            System.err.println("Team of know? \t" + queue.isEmpey());
        } catch (Exception e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值