package com.util.MyStack;
public class MyStack {
private int maxSize;
private long[]stackArray;
private int top;
public MyStack(int s){
maxSize = s;
stackArray = new long[maxSize];
top = -1;
}
public void push(long j){
stackArray[++top] = j;
}
public long pop(){
return stackArray[top--];
}
public long peek(){
return stackArray[top];
}
public boolean isEmpty(){
return top==-1;
}
public boolean isFull(){
return top==maxSize-1;
}
}
转载于:https://www.cnblogs.com/airycode/p/5193047.html