Java :从简单链表中删除节点

public class LinkedList {
    private Node head;

    private static class Node {
        int data;
        Node next;

        Node(int data) {
            this.data = data;
            this.next = null;
        }
    }

    public void deleteNode(int key) {
        Node temp = head;
        Node prev = null;

        // 如果头节点是待删除节点
        if (temp != null && temp.data == key) {
            head = temp.next;
            return;
        }

        // 遍历链表，找到待删除节点的前一个节点
        while (temp != null && temp.data != key) {
            prev = temp;
            temp = temp.next;
        }

        // 如果找到了待删除节点
        if (temp != null) {
            prev.next = temp.next;
        }
    }

    // 省略其他操作方法...

    public static void main(String[] args) {
        LinkedList list = new LinkedList();
        list.head = new Node(1);
        Node second = new Node(2);
        Node third = new Node(3);

        list.head.next = second;
        second.next = third;

        System.out.println("原始链表：");
        list.printList();

        int key = 2;
        list.deleteNode(key);
        System.out.println("删除节点 " + key + " 后的链表：");
        list.printList();
    }
}