java实现栈

Java实现链式栈

public class Stack {

	int count;
	Node top;
	public Stack(){
		count=0;
		top=null;
	}
	public void push(Object n) {  //入栈
		Node node=new Node();
		node.data=n;
		node.next=top;
		count++;
		top=node;
	}
	
	public Object pop() {  //出栈
		if(top!=null) {
			Object x=top.data;
			top=top.next;
			this.count--;
			return x;
		}else {
			return null;
		}
	}
	
	public int length() {  //栈的长度
		return this.count;
	}
	
	public boolean isEmpty() { //判空
		if(top==null)
			return true;
		else
			return false;
	}
	
	public Object topvalue() { //获取栈顶元素
		if(top!=null)
			return top.data;
		else
			return null;
	}
	
	public void print() {  //输出栈中所有元素
		Node p=top;
		while(p!=null) {
			System.out.print(p.data+" ");
			p=p.next;
		}
	}
	
	class Node{
		Object data;
		Node next;
		Node(){
		}
	}
	public static void main(String[] args) {
		Stack stack=new Stack();
		stack.push(1);
		stack.push('a');
		System.out.println("栈中元素数量："+stack.length());
		System.out.print("输出栈：");
	}
}