package oder;
/*栈*/
public class Stack {
private int size;//栈的大小
private int top;//栈顶元素的下标
private char [] stackArray;//栈的容器
public Stack(int size) {
stackArray = new char [size];
top = -1;//初始化栈的时候,栈内无元素,栈顶下表为-1
this.size = size;
}
//入栈,同时栈顶元素的下标加1
public void push(char elem){
stackArray [++top] = elem;//插入栈顶
}
//出栈,删除栈顶元素,同时栈顶元素的下表减1
public char pop(){
return stackArray [top--];
}
//查看栈顶元素,但不删除
public char peek(){
return stackArray [top];
}
//判空
public boolean isEmpty(){
return (top == -1);
}
//判满
public boolean isFull(){
return (top == size-1);
}
}