没什么难点 留个纪念
注意这是尾插法
package link;
public class LinkQueue {
int size = 0;
LinkNode front;//队头指针,指向队头节点
LinkNode rail;//队尾指针,指向队尾节点
public boolean isEmpty() {
return size == 0 ? true : false;
}
public boolean add(int x){
if(front == null){
LinkNode node = new LinkNode(x);
front = node;
rail = node;
return true;
}
LinkNode node = new LinkNode(x);
rail.next = node;
rail = node;
size++;
return true;
}
public boolean remove(){
if(isEmpty()){
System.out.println("当前队列为空");
return false;
}
front = front.next;
size--;
return true;
}
@Override
public String toString() {
return front.toString();
}
public static void main(String[] args) {
LinkQueue queue = new LinkQueue();
queue.add(1);
queue.add(2);
queue.add(3);
System.out.println(queue);
queue.remove();
System.out.println(queue);
}
}