[Java知识库]java 数组模拟栈

public class MyStack {
    private Object[] data;
    private int index;

    public MyStack() {
        //在这里我们初始化一下数组data的默认长度
        data = new Object[10];
        index=-1;
        //为什么不在主程序中创建数组，我认为，在这里创建数组，可以为每一个对象都创建一个
        //数组，这样一个栈对象就更像一个栈了，他可以完成出栈和入栈的功能了
    }

    public MyStack(Object[] data, int index) {
        this.data = data;
        this.index = index;
    }

    public Object[] getData() {
        return data;
    }

    public void setData(Object[] data) {
        this.data = data;
    }

    public int getIndex() {
        return index;
    }

    public void setIndex(int index) {
        this.index = index;
    }
    public void push(Object obj){
        if(index==this.data.length-1){
            System.out.println("栈已满，压栈失败");
            return;//退出此方法
        }
        this.data[++index]=obj;
        System.out.println("数据"+obj+"已经被压入到栈中，在栈中的位置为"+index);
    }
    public Object pop(){
        if(index==-1){
            System.out.println("栈已空，出栈失败");
            return null;
        }
        System.out.println("数据"+this.data[index]+"已经被弹出栈中"+index);
        return this.data[index--];
    }
}

import java.util.Arrays;

public class Test {
    public static void main(String[] args) {
        MyStack myStack = new MyStack();
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.push(new Object());
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
        myStack.pop();
    }
}