用c写一个包含绝大链表函数的程序
时间: 2023-03-29 11:02:53 浏览: 64
好的,我可以回答这个问题。以下是一个用 C 语言编写的包含绝大链表函数的程序:
```c
#include <stdio.h>
#include <stdlib.h>
// 定义链表节点结构体
typedef struct node {
int data;
struct node *next;
} Node;
// 创建链表
Node *createList(int n) {
Node *head = NULL, *tail = NULL;
for (int i = ; i < n; i++) {
Node *node = (Node *) malloc(sizeof(Node));
node->data = i + 1;
node->next = NULL;
if (head == NULL) {
head = tail = node;
} else {
tail->next = node;
tail = node;
}
}
return head;
}
// 遍历链表
void traverseList(Node *head) {
Node *p = head;
while (p != NULL) {
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
// 插入节点
Node *insertNode(Node *head, int pos, int data) {
Node *node = (Node *) malloc(sizeof(Node));
node->data = data;
node->next = NULL;
if (pos == 1) {
node->next = head;
head = node;
} else {
Node *p = head;
for (int i = 1; i < pos - 1; i++) {
p = p->next;
}
node->next = p->next;
p->next = node;
}
return head;
}
// 删除节点
Node *deleteNode(Node *head, int pos) {
if (pos == 1) {
Node *p = head;
head = head->next;
free(p);
} else {
Node *p = head;
for (int i = 1; i < pos - 1; i++) {
p = p->next;
}
Node *q = p->next;
p->next = q->next;
free(q);
}
return head;
}
int main() {
Node *head = createList(5);
traverseList(head);
head = insertNode(head, 3, 6);
traverseList(head);
head = deleteNode(head, 4);
traverseList(head);
return ;
}
```
这个程序包含了创建链表、遍历链表、插入节点和删除节点等绝大链表函数。