使用LinkedList模拟一个堆栈或队列数据结构
堆栈:先进后出
堆栈:先进后出
队列:FIFO 先进先出
import java.util.*;
class DuiLie {
private LinkedList link;
public DuiLie() {
link = new LinkedList();
}
public void myAdd(Object obj) {
link.addFirst(obj);
}
public Object myGet() {
return link.removeFirst();
}
public Object myGetlast() {
return link.removeLast();
}
public boolean isNull() {
return link.isEmpty();
}
}
public class LinkedListTest {
public static void main(String[] args) {
DuiLie dl = new DuiLie();
dl.myAdd("java-01");
dl.myAdd("java-02");
dl.myAdd("java-03");
dl.myAdd("java-04");
/*
* while(!dl.isNull()){ System.out.println(dl.myGet()); }
*/
while (!dl.isNull()) {
System.out.println(dl.myGetlast());
}
}
}