C++实现单链表删除重复节点
时间: 2023-05-15 17:05:00 浏览: 89
以下是 C 实现单链表删除重复节点的代码:
```c
#include <stdio.h>
#include <stdlib.h>
// 定义链表节点结构体
typedef struct Node {
int data;
struct Node *next;
} Node;
// 创建链表
Node *createList(int arr[], int n) {
Node *head = NULL, *p = NULL;
for (int i = 0; i < n; i++) {
Node *node = (Node *)malloc(sizeof(Node));
node->data = arr[i];
node->next = NULL;
if (head == NULL) {
head = node;
p = node;
} else {
p->next = node;
p = node;
}
}
return head;
}
// 删除重复节点
void deleteDuplicate(Node *head) {
Node *p = head, *q = NULL, *r = NULL;
while (p != NULL) {
q = p->next;
r = p;
while (q != NULL) {
if (q->data == p->data) {
r->next = q->next;
free(q);
q = r->next;
} else {
r = q;
q = q->next;
}
}
p = p->next;
}
}
// 打印链表
void printList(Node *head) {
Node *p = head;
while (p != NULL) {
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
int main() {
int arr[] = {1, 2, 3, 2, 4, 4, 5};
int n = sizeof(arr) / sizeof(int);
Node *head = createList(arr, n);
printf("原链表:");
printList(head);
deleteDuplicate(head);
printf("删除重复节点后的链表:");
printList(head);
return 0;
}
```
希望能对您有所帮助!