说明:栈的顺序存储结构及Java实现 //MyStack.java public class MyStack { int MAX_SIZE = 100; int top; String[] stack; public void init(String[] array){ stack = new String[100]; top = -1; for (int i = 0; i MAX_SIZE) { return false; }else { top = top + 1; stack[top] = p <fjs727558285> 上传 | 大小:12kb