Queue(java)实现先进先出JAVA学习资料 2008-06-22 17:00:29 阅读10 评论0 字号:大中小
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
public class Queue {
private LinkedList ll = new LinkedList();
public void put(Object[] o) {
for (int i = 0; i < o.length; i++) {
ll.addLast(o[i]);
}
}
// 使用removeFirst()方法,返回队列中第一个数据,然后将它从队列中删除
public Object get() {
return ll.removeFirst();
}
public boolean empty() {
return ll.isEmpty();
}
public static void main(String[] args) {
Queue mq = new Queue();
String[] str = { "e", "a", "b", "d" };
mq.put(str);
while (!mq.empty()) {
System.out.println(mq.get());
}
}
}
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
public class Queue {
private LinkedList ll = new LinkedList();
public void put(Object[] o) {
for (int i = 0; i < o.length; i++) {
ll.addLast(o[i]);
}
}
// 使用removeFirst()方法,返回队列中第一个数据,然后将它从队列中删除
public Object get() {
return ll.removeFirst();
}
public boolean empty() {
return ll.isEmpty();
}
public static void main(String[] args) {
Queue mq = new Queue();
String[] str = { "e", "a", "b", "d" };
mq.put(str);
while (!mq.empty()) {
System.out.println(mq.get());
}
}
}