Java使用链表头插法模拟栈

public class LinkedListStackDemo {
    public static void main(String[] args) {
        LinkedListStack linkedListStack = new LinkedListStack();
        Node node1 = new Node(1,"李明");
        Node node2 = new Node(2,"王鹏");
        Node node3 = new Node(3,"张华");
        Node node4 = new Node(4,"代月");
        linkedListStack.push(node1);
        linkedListStack.push(node2);
        linkedListStack.push(node3);
        linkedListStack.push(node4);
        System.out.println("入栈后从栈顶开始显示栈的情况：");
        linkedListStack.list();
        try{
            Node res = linkedListStack.pop();
            System.out.println("出栈的节点为：");
            System.out.println(res);
        }
        catch (Exception e) {
            System.out.println(e.getMessage());
        }

        System.out.println("出栈后情况显示：");
        linkedListStack.list();
    }
}
class LinkedListStack{
    Node head = new Node(0,"");
    public boolean isEmpty() {
        return head.next == null;
    }
    //使用头插法入栈，方便出栈
    public void push(Node node) {
        if(head.next == null) {
            head.next = node;
            return;
        }
        node.next = head.next;
        head.next = node;
    }
    //出栈
    public Node pop() {
        if(isEmpty()) {
            throw new RuntimeException("栈为空，无法出栈");
        }
        Node res = head.next;
        head.next = head.next.next;
        return res;
    }
    //从栈顶显示数据
    public void list() {
        if(isEmpty()) {
            System.out.println("栈为空，无数据显示");
            return;
        }
        Node temp = head.next;
        while(temp != null) {
            System.out.println(temp);
            temp = temp.next;
        }
    }
}
class Node {
    public int no;
    public String name;
    public Node next;
    public Node(int no, String name) {
        this.no = no;
        this.name = name;
    }

    @Override
    public String toString() {
        return "Node{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }
}