📄 sqstack.java
字号:
package exercise0;
//定义栈
public class SqStack {
public final int MAXSIZE =65535;
private int top = 0;
private int stacksize;
private OneState[] base;
public SqStack() {
stacksize = MAXSIZE;
base = new OneState[stacksize];
}
//入栈
public boolean Push(OneState e) {
if (top >= stacksize) {
System.out.println("the Stack has full;");
return false;
}
base[top++] = e;
return true;
}
//出栈
public OneState PoP() {
if (top == 0) {
System.out.println("the Stack is Empty");
return null;
}
OneState e = base[--top];
return e;
}
public boolean IsEmpty() {
if (top == 0)
return true;
return false;
}
public void DestoryStack() {
top = 0;
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -