顺序栈--Java实现

 /*栈和队列：逻辑结构属于操作受限的线性表
  *栈：特点先进后出，只允许在栈顶操作
  *栈的实现方式：顺序栈和链栈
  *常见的操作：进栈，出栈，获取栈顶，判空，判满，栈的容量
  *栈的应用
  *1.逆序相关操作
  *2.分隔符匹配
  * */
 //顺序栈
 public class MyStack {
     private long[] arr;
     private int maxSize;//栈的容量
     private int top;//栈顶指针

     public MyStack(int s) {
         maxSize = s;
         arr = new long[maxSize];
         top = -1;
     }

     public boolean isFull(){
         return top == maxSize - 1;
     }

     public boolean isEmpty(){
         return top == -1;
     }

     //进栈必须先判断满了吗
     public void push(long key){
         if(!isFull()){
             arr[++top] = key;
         }
     }

     //出栈前判断是否为空
     public long pop(){
         long num = 0;
         if(!isEmpty()){
             num = arr[top--];
         }
         return num;
     }

     //得到栈顶元素
     public long getPeek(){
         return arr[top];
     }

     //显示栈的元素
     public void diaplayStack(){
         for(int i = top;i >= 0; i--){
             System.out.print(arr[i] + " ");
         }
         System.out.println();
     }

     public int size(){
         return top + 1;
     }

     public long getPeekN(int n){
         return arr[n];
     }

     public void displayStack(String s){
         System.out.println(s);
         System.out.println("stack----bottom to top");
         for(int i = 0; i < size(); i++){
             System.out.print(getPeekN(i) + " ");
         }
         System.out.println();
     }

 }