下压栈（LIFO）动态调整数组大小

package chapter_01;

import java.util.Iterator;

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

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

	private Item[] a = (Item[]) new Object[1];
	private int N = 0;
	private boolean isEmpty() {
		return N==0;
	}
	private void resize(int max) {
		Item[] temp = (Item[]) new Object[max];
		for (int i=0;i<N;i++) {
			temp[i]=a[i];
		}
		a=temp;
	}
	public void push(Item item) {
		if (N==a.length) {
			resize(a.length*2);
		}
		a[N++] = item;
	}
	public Item pop() {
		Item item = a[--N];
		a[N]=null;
		if (N>0&&N==a.length/4) {
			resize(a.length/2);
		}
		return item;
	}
	private class ReverseArrayIterator implements Iterator<Item> {

		private int i = N;
		@Override
		public boolean hasNext() {
			return i>0;
		}

		@Override
		public Item next() {
			return a[--i];
		}

		@Override
		public void remove() {
		}
		
	}
}