实现带头结点的单链表的建立、求长度,取元素、修改元素、插入、删除等单链表的基本操作的c语言代码
时间: 2025-02-07 20:02:58 浏览: 37
在C语言中,我们可以创建一个简单的单链表结构来实现上述操作。这里是一个基础的单链表节点结构以及相关的函数:
```c
// 定义链表节点结构
typedef struct Node {
int data; // 数据域
struct Node* next; // 指针域,指向下一个节点
} Node;
// 创建一个新的链表节点
Node* createNode(int value) {
Node* newNode = (Node*)malloc(sizeof(Node));
if (!newNode) {
printf("Memory allocation failed.\n");
return NULL;
}
newNode->data = value;
newNode->next = NULL;
return newNode;
}
// 链表长度(头插法)
int getLength(Node* head) {
int length = 0;
Node* current = head;
while (current != NULL) {
length++;
current = current->next;
}
return length;
}
// 获取并删除指定位置的元素(假设索引从0开始)
int getElementAndRemove(Node** head, int index) {
if (index < 0 || *head == NULL) {
printf("Invalid index or empty list.\n");
return -1;
}
int element = (*head)->data;
Node* temp = *head;
for (int i = 0; i < index && temp != NULL; i++) {
temp = temp->next;
}
if (temp == NULL) {
printf("Index out of range.\n");
return -1;
}
Node* nextNode = temp->next;
free(temp);
*head = nextNode;
return element;
}
// 修改指定位置的元素
void modifyElement(Node** head, int index, int newValue) {
if (index < 0 || *head == NULL) {
printf("Invalid index or empty list.\n");
return;
}
Node* temp = *head;
for (int i = 0; i < index && temp != NULL; i++) {
temp = temp->next;
}
if (temp == NULL) {
printf("Index out of range.\n");
return;
}
temp->data = newValue;
}
// 插入元素到链表的特定位置
void insertElement(Node** head, int index, int value) {
if (index < 0 || index > getLength(*head)) {
printf("Invalid index.\n");
return;
}
Node* newNode = createNode(value);
if (index == 0) {
newNode->next = *head;
*head = newNode;
} else {
Node* current = *head;
for (int i = 0; i < index - 1; i++) {
current = current->next;
}
newNode->next = current->next;
current->next = newNode;
}
}
// 删除链表中的第一个匹配元素
void deleteElement(Node** head, int value) {
if (*head == NULL) {
return;
}
if ((*head)->data == value) {
Node* temp = *head;
*head = (*head)->next;
free(temp);
} else {
Node* current = *head;
while (current->next != NULL && current->next->data != value) {
current = current->next;
}
if (current->next != NULL) {
current->next = current->next->next;
free(current->next);
}
}
}
阅读全文
相关推荐


















