javaSE (二十一）LinkedList模拟栈和队列

1、LinkedList模拟栈：
如果是模拟队列的话，把list.removeLast()改成list.removeFirst()，先进先出

Stack.java

package cn.njupt;

import java.util.LinkedList;

public class Stack {
	private LinkedList list = new LinkedList();

	public void push(Object o) {
		list.addLast(o);
	}

	public void pop() {
		System.out.println(list.removeLast());
	}

	public void popAll() {
		while (!list.isEmpty()) {
			System.out.println(list.removeLast());
		}
	}

	public void stackisEmpty() {
		System.out.println(list.isEmpty());
	}

}

StackTest.java

package cn.njupt;

public class StackTest {

	public static void main(String[] args) {
		Stack st = new Stack();
		st.push(new Student("吴亦凡", 23));
		st.push("a");
		st.push(100);

		st.pop();
		st.pop();
		st.pop();
		// st.popAll();

		st.stackisEmpty();
	}
}

输出：
100
a
Student [name=吴亦凡, age=23]
true