java的链表实现队列_基于java链表实现队列

public class LinkedListQueue implements Queue {

//将Node节点设计成私有的类中类

private class Node {

public E e;

public Node next;

//两个参数的构造函数

public Node(E e, Node next) {

this.e = e;

this.next = next;

}

//一个参数的构造函数

public Node(E e) {

this.e = e;

this.next = null;

}

//无参构造函数

public Node() {

this(null, null);

}

@Override

public String toString() {

return e.toString();

}

}

private Node head, tail;

private int size;

//显示初始化

public LinkedListQueue() {

head = null;

tail = null;

size = 0;

}

//获取队列中节点个数

@Override

public int getSize() {

return size;

}

//队列中是否为空

@Override

public boolean isEmpty() {

return size == 0;

}

//链表尾部进队操作

@Override

public void enqueue(E e) {

if (tail == null) {

tail = new Node(e);

head = tail;

} else {

tail.next = new Node(e);

tail = tail.next;

}

size++;

}

//链表头部出队操作

@Override

public E dequeue() {

if (isEmpty()) {

throw new IllegalArgumentException("链表为空");

}

Node retNode = head;

head = head.next;

retNode.next = null;

if (head == null) {//当链表只有一个元素时

tail = null;

}

size--;

return retNode.e;

}

//获取队首元素

@Override

public E getFront() {

if (isEmpty()) {

throw new IllegalArgumentException("链表为空");

}

return head.e;

}

//为了便于测试，重写object类toString()方法

@Override

public String toString() {

StringBuilder res = new StringBuilder();

res.append("Queue: front ");

Node cur = head;

while (cur != null) {

res.append(cur + "->");

cur = cur.next;

}

res.append("NULL tail");

return res.toString();

}

}