用链表(LinkedList)封装成堆栈

package linkedlist_stack;

import java.util.LinkedList;

public class Link_stack {
//栈的特点:先进后出，只能从栈顶取元素或删除元素
	private LinkedList lstack;
	public Link_stack()
	{
		lstack=new LinkedList();
	}
	
	public void push(Object obj)     //向栈中压入数据
	{
		lstack.addFirst(obj);         
	}
	
	public Object pop()     //从栈顶取出元素
	{
		return lstack.removeLast();
	}
	
	public boolean isEmpty()
	{
		return lstack.isEmpty();
	}
}

//以下简单的演示
package linkedlist_stack;

public class Test_stack {

	public static void main(String[] args)
	{
		Link_stack stack=new Link_stack();
		stack.push("apples");
		stack.push("oranges");
		stack.push("bananas");
		stack.push("juice");
		
		while(!stack.isEmpty())
			System.out.print(stack.pop()+" ");
		System.out.println();
	}
}