package com.briup.day13.que5;
public class Node {
Node prev;
int data;
Node next;
public Node(Node prev,int data,Node next) {
this.prev = prev;
this.data = data;
this.next = next;
}
}
package com.briup.day13.que5;
public class Queue {
private Node first;
private Node last;
private int size = 0;
public void add(int element) {
Node lNode = last;
Node newNode = new Node(lNode, element, null);
last = newNode;
if(lNode==null) {
first = newNode;
}else {
lNode.next = newNode;
}
size++;
}
public int remove() {
Node fNode = first;
if(fNode==null) {
throw new RuntimeException("该队列为空");
}
int oldValue = fNode.data;
first = fNode.next;
fNode = null;
size--;
return oldValue;
}
public int size() {
return size;
}
public void show() {
Node currentNode = first;
StringBuilder sb = new StringBuilder("[");
for(int i = 0;i<size;i++) {
sb.append(currentNode.data);
if(i!=size-1) {
sb.append(",");
}
currentNode = currentNode.next;
}
sb.append("]");
System.out.print(sb.toString());
}
}