import java.lang.*;
public class StackTest
{
private Object[] obj = new Object[100];
private int size = 0;//数组中元素的个数
public StackTest(){}//构造方法
public boolean empty()//判断是否为空
{
return size ==0;
}
public Object push(Object o)//把元素压到栈的底部
{
this.obj[this.size] = o;
size ++;
return o;
}
public Object pop()//把最后的元素删除
{
if (this.size ==0)
{
System.out.println("该栈为空!");
System.exit(0);
}
this.size --;
Object o = this.obj[this.size];
this.obj[this.size]=null;
return o;
}
public Object peek()//查找某个元素
{
if (this.size == 0)
{
System.out.println("该栈为空!");
System.exit(0);
}
return this.obj[this.size-1];
}
public void view()
{
if (this.size == 0)
{
System.out.println("该栈为空!");
System.exit(0);
}
for (int i= 0; i<size; i++)
{
System.out.println(this.obj[i]);
}
}
public static void main(String[] args)
{
StackTest stack = new StackTest();
String str = "ANGEL";
Integer a = new Integer(20);
StringBuffer b = new StringBuffer("如果真的有来生");
String str1= new String("相亲相爱");
stack.push(str);
stack.push(a);
stack.push(b);
stack.push(str1);
//stack.pop();
if (!stack.empty())
{
System.out.println("不为空");
}
stack.view();
}
}