Java手写栈

public class Stack {
    private long[] a;
    private int size;
    private int top;
    public Stack(int maxsize) {
        this.size = maxsize;
        this.a = new long[size];
        this.top = -1;
    }
    public long peek() {
        if(isEmpty()){
            System.out.println("no available data");
            return 0;
        }
        return a[top];
    }
    public void push(long value){
        if(isFull()){
            System.out.println("stack is full");
            return ;
        }
        a[++top] = value;
    }
    public long pop(){
        if(isEmpty()){
            System.out.println("no available data");
            return 0;
        }
        return a[top--];
    }
    
    public int size(){
        return top+1;
    }
    public boolean isEmpty(){
        return (top == -1);
    }
    public boolean isFull(){
        return (top == size -1);
    }
    public void display(){
        for(int i = top; i >= 0; i--){
            System.out.println(a[i]+" ");
        }
        System.out.println(" ");
    }
}