//Stack.java public class Stack { private char[] stackArray; private int maxSize; private int top; public Stack(int max) { maxSize = max; stackArray = new char[maxSize]; top = -1; } public void push(char element) { stackArray[++top] = element; } public char pop() { return stackArray[top--]; } public char peek() { return stackArray[top]; } public boolean isEmpty() { return top == -1; } public boolean isFull() { return top == maxSize - 1; } }
栈的初步认识
猜你喜欢
转载自samkee.iteye.com/blog/2228018
今日推荐
周排行