#include <stdlib.h>
#include <stdio.h>
struct node {
int value;
struct node* next;
};
typedef struct node node_t;
void print_list(node_t *head) {
node_t *temp = head;
while(temp -> next != NULL) {
printf("%d -> ", temp->value);
temp = temp->next;
}
printf("%d ", temp->value);
printf("\n");
}
node_t* create_new_node(int value) {
node_t *temp;
temp = malloc(sizeof(node_t));
temp -> value = value;
return temp;
}
void insert_after_node(node_t *tmp, node_t *newnode) {
newnode -> next = tmp -> next;
tmp -> next = newnode;
}
node_t* find_node(int num, node_t* head) {
node_t *tmp = head;
while(tmp != NULL) {
if(tmp -> value == num)return tmp;
tmp = tmp -> next;
}
return NULL;
}
node_t* delete_head(node_t* head) {
node_t* temp = head;
head = head -> next;
free(temp);
return head;
}
void free_list(node_t* head) {
node_t* temp = head;
while(head != NULL) {
free(temp);
temp = head;
head = head -> next;
}
}
int main(){
node_t *head = NULL;
node_t *temp = NULL;
for(int i = 0; i < 10; i++) {
temp = create_new_node(i);
temp -> next = head;
head = temp;
}
print_list(head);
insert_after_node(
find_node(8, head),
create_new_node(13));
print_list(head);
head = delete_head(head);
print_list(head);
free_list(head);
return 0;
}
输出:
9 -> 8 -> 7 -> 6 -> 5 -> 4 -> 3 -> 2 -> 1 -> 0
9 -> 8 -> 13 -> 7 -> 6 -> 5 -> 4 -> 3 -> 2 -> 1 -> 0
8 -> 13 -> 7 -> 6 -> 5 -> 4 -> 3 -> 2 -> 1 -> 0
free(): double free detected in tcache 2
Aborted (core dumped)
我试图使用C语言实现链表的基本操作。它包括一些基本函数,如使用malloc创建新节点、打印列表、在特定节点之后插入节点以及使用free释放整个列表。但是我遇到了错误。有人可以给我一些见解吗?
free
两次。现在是学习如何调试程序的好时机。例如,我建议你逐语句地步进你的free_list
函数,同时监视变量及其值(特别是跟踪所有指针指向的位置)。 - Some programmer dude