/*
利用LinkedList来实现队列(先进先出)和堆栈(先进后出)
堆栈:后进先出
队列:先进先出
*/
import java.util.*;
/*队列:将LinkedList进行封装,实现队列先进先出的功能特点*/
class Duilie
{
private LinkedList link;
Duilie()
{
link=new LinkedList();
}
public void myAdd(Object obj)
{
link.addFirst(obj);
sop(link.getFirst());
}
public Object myGet()
{
return link.removeLast();
}
public boolean isEmpty()
{
return link.isEmpty();
}
public static void sop(Object obj)
{
System.out.println(obj);
}
}
/*
堆栈:将LinkedList进行封装,实现堆栈后进先出的功能特点
*/
class Duizhan
{
private LinkedList link;
Duizhan()
{
link=new LinkedList();
}
public void myAdd(Object obj)
{
link.addFirst(obj);
sop(link.getFirst());
}
public Object myGet()
{
return link.removeFirst();
}
public boolean isEmpty()
{
return link.isEmpty();
}
public static void sop(Object obj)
{
System.out.println(obj);
}
}
class LinkedL
java 集合框架-利用LinkedList实现堆栈数据结构
最新推荐文章于 2021-05-29 21:40:45 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)