public class Stack {
int[] data;
int maxSize;
int top;
public Stack(int maxSize){
this.maxSize = maxSize;
data = new int[maxSize];
top = -1;
}
//入栈
public boolean push(int data){
//入栈先判断栈中是否已满
if(top + 1 == maxSize){
System.out.println("栈已满");
return false;
}
this.data[++top] = data;
return true;
}
//出栈
}
return this.data[top--];
}
int[] data;
int maxSize;
int top;
public Stack(int maxSize){
this.maxSize = maxSize;
data = new int[maxSize];
top = -1;
}
//入栈
public boolean push(int data){
//入栈先判断栈中是否已满
if(top + 1 == maxSize){
System.out.println("栈已满");
return false;
}
this.data[++top] = data;
return true;
}
//出栈
public int pop() throws Exception{
//出栈先判断栈是否已空
if(top == -1){
throw new Exception("栈已空");}
return this.data[top--];
}