java栈（链表实现）

实现代码

//定义一个链表
 class Node<T> {
    private T data;
    private Node<T> next;
 
    public Node(T data, Node<T> next) {
        this.data = data;
        this.next = next;
    }
    
    public Node() {
	}
	public T getData() {
        return data;
    }
 
    public void setData(T data) {
        this.data = data;
    }
 
    public Node<T> getNext() {
        return this.next;
    }
 
    public void setNext(Node<T> next) {
        this.next = next;
    }
}

 //链表栈
 class LinkStack<N> {
    private Node<N> top;//栈顶
    private int size=0;//记录栈中元素个数
 
    public LinkStack(Node<N> head) {
		this.top = head;
	}

    public LinkStack() {
		super();
	}

	public Node<N> peek() {//查看栈顶元素
        return top;
    }
 
    public void setHead(Node<N> head) {
        this.top = head;
    }
    //查看栈的大小
    public int getSize() {
        return size;
    }
    public void push(N data){//入栈
    	Node<N> node = new Node<>(data,null);
        if(isEmpty()){
            top = node;
            size++;
        }else{
            node.setNext(top);//将新加入的点放在原来头结点的前面
            top = node;//指向新的栈顶
            size++;
        }
    }
 
    public N pop(){//出栈
        if(!isEmpty()){//判断是否为空
            N data = top.getData();
            top = top.getNext();
            size--;
            return data;
        }else{
            throw new RuntimeException("栈是空的!");
        }
    }
 
    //是否为空
    public boolean isEmpty(){
        return size == 0;
    }
}

测试代码

public class LinkedStackTest {
    //测试
	public static void main(String[] args) {
		LinkStack<Integer> stack = new LinkStack<Integer>();
		stack.push(10);
		stack.push(20);
		stack.push(30);
		stack.push(40);
		stack.push(50);
		System.out.println("入栈顺序: 10->20->30->40->50");
		System.out.print("出栈顺序:");
		while(!stack.isEmpty()) {
			System.out.printf(" %d ",stack.pop());
		}
	}
}

实现截图