删除双向链表Java中值最小的泛型类型节点

public class DoublyLinkedList<T extends Comparable<T>> {
    private Node<T> head;
    private Node<T> tail;

    private class Node<T> {
        private T value;
        private Node<T> prev;
        private Node<T> next;

        public Node(T value) {
            this.value = value;
            this.prev = null;
            this.next = null;
        }
    }

    // 添加节点到链表尾部
    public void add(T value) {
        Node<T> newNode = new Node<>(value);
        if (head == null) {
            head = newNode;
            tail = newNode;
        } else {
            tail.next = newNode;
            newNode.prev = tail;
            tail = newNode;
        }
    }

    // 删除值最小的节点
    public void deleteMinNode() {
        if (head == null) {
            return;
        }

        Node<T> minNode = head;
        Node<T> currentNode = head;

        while (currentNode != null) {
            if (currentNode.value.compareTo(minNode.value) < 0) {
                minNode = currentNode;
            }
            currentNode = currentNode.next;
        }

        if (minNode == head) {
            head = head.next;
            if (head != null) {
                head.prev = null;
            }
        } else if (minNode == tail) {
            tail = tail.prev;
            if (tail != null) {
                tail.next = null;
            }
        } else {
            minNode.prev.next = minNode.next;
            minNode.next.prev = minNode.prev;
        }
    }

    // 打印链表
    public void printList() {
        Node<T> currentNode = head;
        while (currentNode != null) {
            System.out.print(currentNode.value + " ");
            currentNode = currentNode.next;
        }
        System.out.println();
    }

    public static void main(String[] args) {
        DoublyLinkedList<Integer> list = new DoublyLinkedList<>();
        list.add(5);
        list.add(2);
        list.add(8);
        list.add(1);
        list.add(7);

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

        list.deleteMinNode();

        System.out.println("删除值最小的节点后的链表：");
        list.printList();
    }
}