队列是一种特殊的线性表,特殊之处在于它只允许在表的前端(front)进行删除操作,而在表的后端(rear)进行插入操作,和栈一样,队列是一种操作受限制的线性表。进行插入操作的端称为队尾,进行删除操作的端称为队头。(该定义来自百度百科)
package text1;
public class CircularArryQueue<E> {
private Node head;
private Node tail;
public CircularArryQueue(){
}
public void adde(E date) {
if(head==null) {
head=new Node(date);
tail=head;
}
else {
tail.next=new Node(date);
tail=tail.next;
}
}
public void removee() {
if(head!=null) {
head=head.next;
}
}
public int getSize() {
int a=0;
Node p=head;
while(p!=null) {
a++;
p=p.next;
}
return a;
}
public void getDate() {
Node p=head;
while(p!=null) {
System.out.println(p.date);
p=p.next;
}
}
public static void main(String[] args) {
CircularArryQueue<String>list=new CircularArryQueue<String>();
list.adde("121");
list.adde("122");
list.adde("123");
list.removee();
System.out.println(list.getSize());
list.getDate();
}
class Node<E> {
public E date;
public Node next;
public Node(E date) {
this.date=date;
}
}
}