sqstack.java

自己编写的人工智能中野人与修道士问题的程序。

package exercise1;

public class SqStack {
	public final int MAXSIZE = 255;

	private int top = 0;

	private int stacksize;

	private OneState[] base;

	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;
	}

}