1 public class ArrayDequeStack {
 2 
 3     public static void main(String[] args) {
 4         ArrayDeque<String> stack = new ArrayDeque<>();
 5         //压栈,此时AAA在最下,CCC在最外
 6         stack.push("AAA");
 7         stack.push("BBB");
 8         stack.push("CCC");
 9         System.out.println(stack);
10         //获取最后添加的元素,但不删除
11         System.out.println(stack.peek());
12         System.out.println(stack);
13         //弹出最后添加的元素
14         System.out.println(stack.pop());
15         System.out.println(stack);
16     }
17 
18 }

 1 public class ArrayDequeQueue {
 2 
 3     public static void main(String[] args) {
 4         ArrayDeque<String> queue = new ArrayDeque<>();
 5         //入队
 6         queue.offer("AAA");
 7         queue.offer("BBB");
 8         queue.offer("CCC");
 9         System.out.println(queue);
10         //获取但不出队
11         System.out.println(queue.peek());
12         System.out.println(queue);
13         //出队
14         System.out.println(queue.poll());
15         System.out.println(queue);
16     }
17 
18 }

 1 public class TestLinkedList {
 2 
 3     public static void main(String[] args) {
 4         LinkedList<String> ll = new LinkedList<>();
 5         //入队
 6         ll.offer("AAA");
 7         //压栈
 8         ll.push("BBB");
 9         //双端的另一端入队
10         ll.addFirst("NNN");
11         ll.forEach(str -> System.out.println("遍历中:" + str));
12         //获取队头
13         System.out.println(ll.peekFirst());
14         //获取队尾
15         System.out.println(ll.peekLast());
16         //弹栈
17         System.out.println(ll.pop());
18         System.out.println(ll);
19         //双端的后端出列
20         System.out.println(ll.pollLast());
21         System.out.println(ll);
22     }
23 }