代码如下,一看便懂
LinkedList<Integer> list=new LinkedList<>();
//-----------------------模拟堆栈-----------------
list.push(1);//入栈
list.push(2);
list.push(3);
list.push(4);
System.out.println(list.size());
while(!list.isEmpty())
{
System.out.println(list.peek());//查看栈顶元素
System.out.println(list.pop());//出栈
}
System.out.println(list.size());
//------------------------模拟队列-----------------
list.addLast(1);//入队
list.addLast(2);
list.addLast(3);
list.addLast(4);
System.out.println(list.removeFirst());//出队
System.out.println(list.getFirst());//查看队首元素