使用LinkedList进行栈结构存储(先进后出,后进先出)
LinkedList<Integer> list = new LinkedList<>();
//压栈
list.push(100);
list.push(200);
//弹栈
Integer i = list.pop();
System.out.println(i);//200
队列存储(先进先出,后进后出)
LinkedList<Integer> list = new LinkedList<>();
list.addFirst(100);
list.addFirst(200);
Integer i = list.removeLast();
System.out.println(i);//100