//在学习栈之前,只需要明确:栈满的时候top的值是maxSize-1,
// 即栈顶值为:stack[top](或stack[maxSize-1])
public class StackTest {
public static void main(String[] args) {
ArrayStack a1 = new ArrayStack(5);
a1.addStack(5);
a1.addStack(4);
a1.addStack(3);
a1.addStack(2);
a1.addStack(1);
a1.listStack();
System.out.println(a1.isEmpty());
System.out.println(a1.isFull());
}
}
class ArrayStack{
private int maxSize;
private int[] stack;
private int top = -1;
public ArrayStack(int maxSize){
this.maxSize = maxSize;
stack = new int[maxSize];
}
public boolean isEmpty(){
return top == -1;
}
public boolean isFull(){
return top == this.maxSize-1;
}
public void addStack(int value){
if(isFull()){
System.out.println("栈满,无法入栈");
return;
}
top++;
stack[top] = value;
}
public int outStack(){
if(isEmpty()){
throw new RuntimeException("栈空,无法出栈");
}
int retValue = stack[top];
top--;
return retValue;
}
public void listStack(){
if(isEmpty()){
throw new RuntimeException("栈空,无法遍历");
}
for(int i=top;i>=0;i--){
System.out.printf("stack[%d] = %d \n",i,stack[i]);
}
}
}
JAVA:栈
最新推荐文章于 2024-10-16 10:13:45 发布