我們通過創建用于插入元素的自定義函數 push() 方法和用于彈出元素的 pop() 方法來實現棧

完整代碼

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);}public static void main(String[] args) {MyStack theStack = new MyStack(10); theStack.push(10);theStack.push(30);theStack.push(50);theStack.push(70);theStack.push(90);while (!theStack.isEmpty()) {long value = theStack.pop();System.out.print(value);System.out.print(" ");}System.out.println("");} }

結果輸出

90 70 50 30 10

總結

以上是生活随笔為你收集整理的Java 栈的存储过程的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。