Stack 继承 Vector 
LIFO last-in-first-out  
public Vector() {
        this(10);
}
Stack   初始容量 10 
 
ArrayDeque LinkedList 实现 Deque 接口
deque   double ended queue

ArrayDeque LinkedList 可以用来实现 Stack
push pop peek 


push addFirst
pop  removeFirst


public ArrayDeque() {
        elements = new Object[16];
}

ArrayDeque 初始容量 16


Stack	  ArrayDeque	                LinkedList
push(e)	  addFirst(e)  /offerFirst(e)	addFirst(e)/offerFirst(e)
pop()	  removeFirst()/pollFirst()	    removeFirst()/pollFirst()
peek()	  getFirst()   /peekFirst()	    getFirst()/peekFirst()

一般不推荐使用Vector以及其子类Stack




Stack<String> stack = new Stack<>();
ArrayDeque<String> arrayDeque = new ArrayDeque<>(1);
LinkedList<String>  linkedList = new LinkedList<>();
		
stack.push("a");
stack.push("b");
stack.push("c");
while(!stack.isEmpty()) {
    System.out.print(stack.pop()+" ");
}
System.out.println();
		
// addFirst
arrayDeque.push("a");
arrayDeque.push("b");
arrayDeque.push("c");
while(!arrayDeque.isEmpty()) {
    // pop  removeFirst
    System.out.print(arrayDeque.pop()+" ");
}
System.out.println();
		
linkedList.addFirst("a");
linkedList.addFirst("b");
linkedList.addFirst("c");
		
while(!linkedList.isEmpty()) {
    System.out.print(linkedList.pop()+" ");
}
    System.out.println();