java栈

package stack;

/**
 * @author moon
 * @create 2021-03-01 20:07
 */
public class ArrayStack {

    private int maxsize;
    private int []stack;
    private int top=-1;
     public ArrayStack(int size){

         this.maxsize=size;
         stack=new int[maxsize];
     }

     //栈满

    public boolean isFull(){

         return top==maxsize-1;
    }
///入栈
    public void push(int value){
         //先判是否栈满
        if(isFull()){

            System.out.print("栈满了");
        }
        top++;
        stack[top]=value;

    }
//判断空栈
    public boolean isempty(){

         return top==-1;
    }
    //出栈
    public int pop(){
        //先判断是否空栈
        if(isempty()){
//            System.out.print("栈空");
            throw new RuntimeException("栈空");

        }
        int value=stack[top];
        top--;
        return value;

    }
    //查看栈
    public void list(){

         for(int i=top;i>0;i--){
                System.out.println(stack[i]);
         }
    }

    public static void main(String[]args){

        ArrayStack arrayStack=new ArrayStack(10);
//        System.out.print(arrayStack.isFull());
        arrayStack.push(1);
        arrayStack.push(1);
        arrayStack.push(3);
        arrayStack.push(1);
        arrayStack.push(1);
        arrayStack.list();
        arrayStack.pop();
        arrayStack.list();

    }

}