队列遵循先进先出的原则，下面看看简单的Demo实例。
package com.tu.test.queue;
public class Node {
int data;
Node next;//next node
public Node(int data){
this.data = data;
}
}
package com.tu.test.queue;
public class MyQueue {
Node head;//first node
Node current;//current node
/**
* put into queue
* @param data
*/
public void add(int data){
Node node = new Node(data);
if (head == null) {
head = node;
current = head;
} else {
current.next = node;
current = current.next;
}
}
public Node pop(){
if (head == null) {
return null;
} else {
Node node = head;
head = node.next;
return node;
}
}
}
package com.tu.test.queue;
public class MyQueueTest {
public static void main(String[] args) {
MyQueue myQueue = new MyQueue();
for (int i = 1; i <= 3;i++) {
myQueue.add(i);
}
for (int i = 1;i<=2;i++) {
System.out.println(myQueue.pop().data);
}
}
}
输出结果：
1
2