使用LinkedList模拟一个堆栈或者队列数据结构

使用LinkedList模拟一个堆栈或者队列数据结构。 

 堆栈：先进后出  如同一个杯子。 

 队列：先进先出  如同一个水管。

 

import java.util.LinkedList;public class DuiLie {private LinkedList link;public DuiLie() {link = new LinkedList();}public void myAdd(Object obj) {link.addFirst(obj);}public Object myGet() {// return link.removeLast();//队列return link.removeFirst();// 堆栈
    }public boolean isNull() {return link.isEmpty();}
}

 

import java.util.LinkedList;public class DuiLie {private LinkedList link;public DuiLie() {link = new LinkedList();}public void myAdd(Object obj) {link.addFirst(obj);}public Object myGet() {return link.removeLast();//队列//return link.removeFirst();// 堆栈
    }public boolean isNull() {return link.isEmpty();}
}

运行结果如图：