package com.javase.advanced.work02;
public class Stack {
private Object[] elements;
private int index;
public Stack() {
this.elements = new Object[10];
this.index = -1;
}
public Object[] getElements() {
return elements;
}
public void setElements(Object[] elements) {
this.elements = elements;
}
public void push(Object o) {
if (index >= elements.length - 1) {
System.out.println("栈满,压栈失败");
return;
}
elements[++index] = o;
System.out.println("压栈" + o + "成功,栈帧指向" + index);
}
public void pop() {
if (index < 0) {
System.out.println("栈空,弹栈失败");
return;
}
System.out.print("弹栈" + elements[index] + "元素成功,");
elements[index--] = null;
System.out.println("栈帧指向" + index);
}
public void traversal() {
for (int i = 0; i <= elements.length - 1; i++) {
System.out.print(elements[i] + " ");
}
System.out.println();
}
}
```java
ackage com.javase.advanced.work02;
public class Test01 {
public static void main(String[] args) {
Stack stack = new Stack();
stack.pop();
stack.pop();
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.push(new Object());
stack.pop();
stack.pop();
stack.traversal();
}
}