声明一个顺序栈类

<pre name="code" class="java">package DataStructureTest;

public class SeqStack<T> implements SStack<T> {

	private int top;//声明一个栈顶元素下标
	private Object element[];
	
	public SeqStack(int size)
	{
		this.element=new Object[Math.abs(size)];
		this.top=-1;
		
	}
	
	public SeqStack(){
		this(64);
	}
	
	public boolean isEmpty() {
		
		return this.top==-1;
	}

	@Override
	public void push(T x) {
		if(x==null)
			return;
		if(this.top==this.element.length-1)
		{
			Object[] temp=this.element;
			element = new Object[this.element.length*2];
			for(int j=0;j<temp.length;j++)
				element[j]=temp[j];
		}
		
		top++;
		element[top]=x;
		
	}

	@Override
	public T pop() {
		
		return  this.top==-1?null:(T)this.element[top--];
		
	}

	@Override
	public T get() {
		// TODO 自动生成的方法存根
		return this.top==-1?null:(T)this.element[top];
	}
	
	

}