package Stack;

public class sequenceStack {
	private final static int SIZE = 100;
	private int top = 0;
	private Student[] arr = new Student[SIZE];

	public void push(Student stu) {
		if (top > SIZE - 1) {
			System.out.println("此栈已经溢出。");
			return;
		}
		arr[top] = stu;
		top++;
	}

	public String pop() {
		if (top < 0) {
			System.out.println("此栈已为空。");
			return null;
		}
		--top;
		return arr[top].name;
	}

	public void show() {
		if (top <=0) {
			System.out.println("此栈已为空。");
			return;
		}
		for (int i = 0; i <top; i++) {
			String name = arr[i].name;
			boolean sex = arr[i].isBoy;
			System.out.print("姓名:" + name + " ");
			if (sex) {
				System.out.println("男");
			} else {
				System.out.println("女");
			}
		}
	}

}