linstacktest.java

来自「数据结构(java描述)课件(第四讲:图论)」· Java 代码 · 共 27 行

public class LinStackTest{	
	public static void main(String[] args){
		
		LinStack myStack = new LinStack();
		
		int test[] = {2, 4, 6, 8, 10};
		int n=5;
		
		try{
			for(int i = 0; i < n; i ++)

			{
				myStack.push(new Integer(test[i]));
				System.out.println("当前入栈元素为：" + test[i]);
			}

			System.out.println("当前栈顶元素为：" + myStack.getTop());
			
			System.out.print("出栈元素序列为：");
			while(myStack.notEmpty())
				System.out.print(myStack.pop()+"  ");
		}
		catch(Exception e){
			System.out.println(e.getMessage());
		}		
	}	
}