Java 实现一个栈

public class StackTest {

    private  int[] elements;
    private  int size=0;
    public StackTest(){
        this.elements = new int[10];
    }


    public   void  push(int element){
        elements[size]=element;
        size++;
    }

    public  void   pop(){
        if(size>=0){
            System.out.println("出栈一个元素："+elements[size-1]);
            elements[size-1]=0;
            size--;
        }else{
            System.out.println("没有元素。。。");
        }

    }

    public void  gettop(){
        System.out.println("栈顶元素为："+elements[size-1]);
    }

    @Override
    public String toString() {
        return Arrays.toString(elements);
    }

    public static void main(String[] args) {
        StackTest stackTest = new StackTest();
        stackTest.push(5);
        stackTest.push(6);
        stackTest.push(88);
        System.out.println(stackTest);
        stackTest.pop();
        System.out.println(stackTest);
        stackTest.gettop();

    }

}