棧的特點(diǎn)：先入后出

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 isFull() {return top == maxSize - 1;}public boolean isEmpty() {return top == -1;}public void push(int value) {if (isFull()) {System.out.println("棧已滿！");return;}top++;stack[top] = value;}public int pop() {if (isFull()) {System.out.println("棧空！");throw new RuntimeException("棧空");}int result = stack[top];top--;return result;}public void list() {if (isEmpty()) {System.out.println("棧空!");}while(!isEmpty()) {System.out.printf("%d,",stack[top]);top--;}} }

總結(jié)

以上是生活随笔為你收集整理的数组模拟栈的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。