使用链表实现栈（基础）

链表实现栈

public class Stack<Item> implements Iterable<Item> {

	private Node first;

	private int N;

	private class Node {
		Item item;
		Node next;
	}

	public boolean isEmpty() {
		return N == 0;
	}

	public int size() {
		return N;
	}

	public void push(Item newItem) {
		Node newNode = new Node();
		newNode.item = newItem;
		newNode.next = first;
		first = newNode;
		N++;
	}

	public Item pop() {
		Item item = first.item;
		first = first.next;
		N--;
		return item;
	}


	@Override
	public Iterator<Item> iterator() {
		return new myIterator<Item>();
	}

	public class myIterator<Item> implements Iterator<Item> {
		private Node node = first;

		@Override
		public boolean hasNext() {
			return node != null;
		}

		@Override
		public Item next() {
			Item item = (Item) node.item;
			node = node.next;
			return item;
		}
	}
	
}