LinkedList学习示例模拟堆栈与队列数据结构

堆栈：先进后出first in last out filo 如同一个杯子
队列：先进先出 first in first out fifo  如同一个水管

class duilie{
    private linkedlist link;
    duilie(){
        link = new linkedlist();
    }
    public void myadd(object obj){
        link.addfirst(obj);
    }
    public object myget(){
        return link.removelast();//改为removelast这样就可以是堆栈和队列的转换
    }
    public boolean isnull(){
        return link.isempty();
    }
}
public class linkedlisttest {
    public static void main(string[] args) {
        duilie dl = new duilie();
        dl.myadd("java01");
        dl.myadd("java02");
        dl.myadd("java03");
        dl.myadd("java04");

        while (!dl.isnull()){
            system.out.println(dl.myget());
        }
    }

}