用Array实现的栈结构,功能与LinkedStack一致
编程上略微比LinkedStack复杂
class ArrayStack {
private Array array = new Array();
private int pos = -1;
void push(int value) {
array.set(value,++pos);
}
int pop() {
assert pos > -1;
int result = array.get(pos);
array.truncate(pos--);
return result;
}
boolean isEmpty() {
return pos == -1;
}
}