package Stack;

public class LNodeStack {
	private LNode head;
	private int top = 0;
	private final static int SIZE = 100;
	

	public LNodeStack() {
		head=new LNode();
	}

	public void push(Student stu) {
		if (top > SIZE - 1) {
			System.out.println("此栈已溢出。");
			return;
		}
		LNode temp = new LNode(stu);
		temp.next = head.next;
		head.next = temp;
		++top;
	}

	public String pop() {
		if (top <= 0) {
			System.out.println("此栈已为空。");
			return null;
		}
		--top;
		int i=0;
		for(LNode temp=head.next;temp!=null;temp=temp.next){
			if(top==i){
				return temp.stu.name;
			}
			i++;
		}
		return null;
	}

	public void show() {
		if (top <= 0) {
			System.out.println("此栈已为空。");
			return;
		}
		for (LNode temp = head.next; temp != null; temp = temp.next) {
			String name = temp.stu.name;
			boolean sex = temp.stu.isBoy;
			System.out.print("姓名:" + name + " ");
			if (sex) {
				System.out.println("男");
			} else {
				System.out.println("女");
			}
		}
	}

}