（65）LinkLIst练习：运用LinkList方法模拟堆栈、队列

来源：互联网发布：淘宝买电脑可靠吗编辑：程序博客网时间：2024/05/17 23:47

模拟队列
/*
* 使用LinkedList模拟堆栈或者队列的数据结构
* 堆栈：先进后出：如同杯子
* 队列：先进先出：如同水管
*/

import java.util.*;public class DuiLie {    private LinkedList link;    DuiLie(){        link=new LinkedList();    }    public void myAdd(Object obj) {        link.addFirst(obj);    }    public Object myGet() {        return link.removeLast();    }    public boolean isNull() {        return link.isEmpty();    }}public class DuiLieDemo {public static void sop(Object obj) {    System.out.println(obj);}    public static void main(String[] args) {        // TODO Auto-generated method stub        DuiLie dl=new DuiLie();        //添加        dl.myAdd("java01");        dl.myAdd("java02");        dl.myAdd("java03");        //根据队列规则删除并获取        while((dl.isNull())!=true)             sop(dl.myGet());    }}

模拟堆栈

import java.util.*;public class DuiZhan {    private LinkedList link;    DuiZhan(){        link=new LinkedList();    }    public void myAdd(Object obj) {        link.addFirst(obj);    }    public Object myGet() {        return link.removeFirst();    }    public boolean isNull() {        return link.isEmpty();    }}public class DuiZhanDemo {    public static void sop(Object obj) {        System.out.println(obj);    }    public static void main(String[] args) {        // TODO Auto-generated method stub       DuiZhan dz=new DuiZhan();       //添加       dz.myAdd("java01");       dz.myAdd("java02");       dz.myAdd("java03");       //获取       while(dz.isNull()!=true) {           sop(dz.myGet());       }    }}

阅读全文

0 0