Java栈的模拟实现

利用Java自己模拟实现栈，具体见代码示例：

public class MyStack {private int maxSize;private long[] stackArray;private int top;public MyStack(int size) {maxSize = size;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 myStack = new MyStack(10); myStack.push(10);myStack.push(20);myStack.push(30);myStack.push(40);myStack.push(50);while (!myStack.isEmpty()) {long value = myStack.pop();System.out.print(value);System.out.print(" ");}}}

运行结果：