队列课下作业

作业要求

1 补充课上没有完成的作业
2 参考15.3节，用自己完成的队列（链队，循环数组队列）实现模拟票务柜台排队功能
3 用JDB或IDEA单步跟踪排队情况，画出队列变化图，包含自己的学号信息
4 把代码推送到代码托管平台
5 把完成过程写一篇博客：重点是单步跟踪过程和遇到的问题及解决过程
6 提交博客链接

一、补充课上没有完成的作业：将《Java程序设计与数据结构教程（第二版）》15章的15.5链表队列的代码中的dequeue()、first()、isempty()、size()、toString()实现：

package ch15;

/**
 * Created by Funny_One on 2017/10/10.
 */
public class LinkedQueue<T> implements Queue<T> {
    private int count;
    private LinearNode<T> front,rear;

    //Creates an empty queue
    public LinkedQueue(){
        count =0;
        front = rear = null;
    }

    @Override
    public void enqueue(T element) {
        LinearNode<T> node = new LinearNode<T>(element);
        if(count == 0){
            front = node;
        }else {
            rear.setNext(node);
        }
        rear = node;
        count++;
    }

    @Override
    public T dequeue() throws EmptyCollectionException{
        T element = front.getElement();
        if(count == 1){
            front = rear = null;
        }else {
            front = front.getNext();
        }
        count--;
        return element;
    }

    @Override
    public T first() {
        T element = front.getElement();
        return element;
    }

    @Override
    public boolean isEmpty() {
        boolean judge=false;
        if (count == 0){
            judge = true;
        }
        return judge;
    }

    @Override
    public int size() {
        return count;
    }

    @Override
    public String toString(){
        String str1 = "<The head of the queue>";
        LinearNode<T> node = new LinearNode<T>();
        node = front;
        while (node!=null){

            if(node.getNext()==null){
                str1 += " "+ node.getElement() + " <The tail of the queue>";
            }else {
                str1 += " "+node.getElement()+",";
            }
            node = node.getNext();
        }
        return  str1;
    }
}