java数据结构——Stack栈（线性表实现）

public class ArrayStack<E> {

	private static final int DEFAULT_CAPACITY = 10;
	
	private int top;
	private E[] items;
	
	@SuppressWarnings("unchecked")
	public ArrayStack() {
		top = -1; 
		items = (E[]) new Object[ DEFAULT_CAPACITY ];  
	}
	
	@SuppressWarnings("unchecked")
	public void push(E data) {
		
		if (top == items.length) {
			E [ ] newItems = (E[]) new Object[ items.length * 2 ];
			System.arraycopy(items, 0, newItems, 0, items.length);
			items = newItems;
		}
		
		items[++top] = data;
	}
	
	public E pop() {
		
		if (top < 0) {
			return null;
		}
		
		return items[ top-- ];
	}

}