从单链表中移除重复元素：原理、实现与注意事项

public class SinglyLinkedList<T> {

    Node headNode;

    class Node {
        T data;
        Node nextNode;

        Node(T data) {
            this.data = data;
            this.nextNode = null;
        }
    }

    public static <T> void removeDuplicates(SinglyLinkedList<T> list) {
        Node current = list.headNode;
        Node compare = null;

        while (current != null && current.nextNode != null) {
            compare = current;
            while (compare.nextNode != null) {
                if (current.data.equals(compare.nextNode.data)) {
                    compare.nextNode = compare.nextNode.nextNode;
                } else {
                    compare = compare.nextNode;
                }
            }
            current = current.nextNode;
        }
    }

    // Example Usage
    public static void main(String[] args) {
        SinglyLinkedList<Integer> list = new SinglyLinkedList<>();
        list.headNode = list.new Node(1);
        list.headNode.nextNode = list.new Node(2);
        list.headNode.nextNode.nextNode = list.new Node(2);
        list.headNode.nextNode.nextNode.nextNode = list.new Node(3);
        list.headNode.nextNode.nextNode.nextNode.nextNode = list.new Node(4);
        list.headNode.nextNode.nextNode.nextNode.nextNode.nextNode = list.new Node(4);
        list.headNode.nextNode.nextNode.nextNode.nextNode.nextNode.nextNode = list.new Node(5);

        System.out.println("Original List:");
        printList(list);

        removeDuplicates(list);

        System.out.println("List after removing duplicates:");
        printList(list);
    }

    public static <T> void printList(SinglyLinkedList<T> list) {
        Node current = list.headNode;
        while (current != null) {
            System.out.print(current.data + " ");
            current = current.nextNode;
        }
        System.out.println();
    }
}