使用一维数组，模拟栈数据结构。

public class MyStack {
Object[] elements;
int index; //定义一个栈帧
public MyStack() {
this.elements = new Object[5]; //初始化数组大小为5
index= -1 ; //初始化栈帧为-1
}

public void push(Object obj){
if (index>=elements.length-1){
System.out.println(“栈已满，压栈失败”);
return;
}
System.out.println(“压栈”+obj+“成功”);
index++;
elements[index]=obj;
System.out.println(“栈帧现在为”+index);
}

public void pop(){
if(index<0){
System.out.println(“栈已空，弹栈失败”);
return;
}
System.out.print(“弹栈”+ elements[index]+“成功”);
index–;
System.out.println(“栈帧现在为”+index);
}
}

//测试类
public class Test {
public static void main(String[] args) {
MyStack stack = new MyStack(); //创建一个栈对象
stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
stack.push(5);
stack.push(6);//栈已满无法压栈

stack.pop();
stack.pop();
stack.pop();
stack.pop();
stack.pop();
stack.pop();//栈已空
}
}