import java.lang.*;
public class MyStack{
private Object[] obj = new Object[100];
private int size = 0;//数组里面元素的个数
public MyStack(){}//构造方法
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("Stack is empty!");
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("Stack is empty!");
System.exit(0);
}
return this.obj[this.size-1];
}
public void view(){
if(this.size == 0){
System.out.println("Stack is empty!");
System.exit(0);
}
for(int i=0;i<size;i++){
System.out.println(this.obj[i]);
}
}
public static void main(String[] args){
MyStack stack = new MyStack();
String str1 = "hello";
Integer s = new Integer(23);
StringBuffer str2 = new StringBuffer(",world");
String str3 = new String("lch");
stack.push(str1);
stack.push(s);
stack.push(str2);
stack.push(str3);
stack.pop();
if(!stack.empty()){
System.out.println("不为空!");
}
stack.view();
}
}