linkedList封装
package com.Collectiom;
import java.util.LinkedList;
/**
* 用linkedList模拟堆栈或者队列数据结构
* @author 小明
*堆栈:先进后出 如同水杯
*队列:先进先出 First in first out 水管
*/
class DuiLie{
private LinkedList link;
DuiLie(){
link = new LinkedList<String>();
}
public void add(Object obj){
link.addFirst(obj);
}
public Object get(){
return link.removeLast();//队列
//return link.removeLast() 堆栈
}
public boolean isFull(){
return link.isEmpty();
}
}
public class LinkedListDemo2 {
public static void main(String[] args) {
DuiLie duiLie = new DuiLie();
duiLie.add("aa");
duiLie.add("bb");
duiLie.add("cc");
duiLie.add("dd");
while(!duiLie.isFull()){
System.out.println(duiLie.get());
}
}
}