下压堆栈（链表实现）

package suanfa;

import java.util.Iterator;
import java.util.NoSuchElementException;

import edu.princeton.cs.algs4.StdIn;
import edu.princeton.cs.algs4.StdOut;


public class LIFO_Linked<Item> implements Iterable<Item>{
	private Node<Item> first;  //栈顶
	private int n; //栈数
	//创建链表类
	private static class Node<Item>{
		private Item item;
		private Node<Item> next;
	}
	//初始化空堆栈
	public  LIFO_Linked(){
		first = null;
		n=0;
	}
	//空栈判断
	public boolean isEmpty(){
		return first == null;//栈顶为Null 链表为空
	}
	//栈大小
	public int size(){
		return n;
	}
	/**
	 * 向栈顶添加元素
	 * @param item 要添加的项
	 */
	public void push(Item item){
		Node<Item> oldeFirst = first;
		first = new Node<Item>();
		first.item = item;
		first.next = oldeFirst;
		n++;
	}
	/**
	 * 删除首项
	 * @return
	 */
	public Item pop()
	{
		if (isEmpty()) throw new NoSuchElementException("Stack underflow");//判断是否为空
		Item item = first.item;//取出栈顶
		first = first.next;//栈顶为第二个 使栈顶变为孤儿，垃圾回收器回收
		n--;//栈数减-
		return item;//返回所删除的项
	}
	/**
	 * 读取数据
	 * @return  返回最近添加到栈顶的项
	 */
	public Item peek(){
		if (isEmpty()) throw new NoSuchElementException("Stack underflow");//判断是否为空
		return first.item;
	}
	/**
	 * 返回toString 字符串形式
	 */
	public String toString(){
		StringBuilder s = new StringBuilder();
		for (Item item : this){
			s.append(item);
			s.append(" ");
		}
		return s.toString();
	}
	
	@Override
	public Iterator<Item> iterator() {
		// TODO Auto-generated method stub
		  return new ListIterator(first);
	}
	public class ListIterator implements Iterator<Item> {
        private Node<Item> current;

        public ListIterator(Node<Item> first) {
            current = first;
        }

        public boolean hasNext() {
            return current != null;
        }

        public void remove() {
            throw new UnsupportedOperationException();
        }

        public Item next() {
            if (!hasNext()) throw new NoSuchElementException();
            Item item = current.item;
            current = current.next; 
            return item;
        }
    }
    public static void main(String[] args) {
    	LIFO_Linked<String> stack = new LIFO_Linked<String>();
        while (!StdIn.isEmpty()) {
            String item = StdIn.readString();
            if (!item.equals("-"))
                stack.push(item);
            else if (!stack.isEmpty())
                StdOut.print(stack.pop() + " ");
        }
        StdOut.println("(" + stack.size() + " left on stack)");
    }
}

参考《算法 第四版》