在链表程序c中查找重复的数据条目

struct ListNode {
    int data;
    struct ListNode* next;
};

struct ListNode* createLinkedList(int* dataArray, int size) {
    struct ListNode* head = NULL;
    struct ListNode* tail = NULL;
    
    for (int i = 0; i < size; i++) {
        struct ListNode* newNode = (struct ListNode*)malloc(sizeof(struct ListNode));
        newNode->data = dataArray[i];
        newNode->next = NULL;
        
        if (head == NULL) {
            head = newNode;
            tail = newNode;
        } else {
            tail->next = newNode;
            tail = newNode;
        }
    }
    
    return head;
}

void findDuplicates(struct ListNode* head) {
    struct ListNode* current = head;
    
    while (current != NULL && current->next != NULL) {
        struct ListNode* runner = current;
        
        while (runner->next != NULL) {
            if (current->data == runner->next->data) {
                // 处理重复数据
                printf("重复的数据条目：%d\n", current->data);
                // 或者删除重复数据节点
                struct ListNode* duplicate = runner->next;
                runner->next = duplicate->next;
                free(duplicate);
            } else {
                runner = runner->next;
            }
        }
        
        current = current->next;
    }
}

int main() {
    int dataArray[] = {1, 2, 3, 4, 2, 5, 3, 6, 2};
    int size = sizeof(dataArray) / sizeof(dataArray[0]);
    
    struct ListNode* head = createLinkedList(dataArray, size);
    findDuplicates(head);
    
    return 0;
}