我们通过创建用于插入元素的自定义函数 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