创建链表,并更新链表中数据项的示例程序,将以下代码保存到一个源文件中:linked_list_update_program.c, 如下所示 -
#include
#include
struct node {
int data;
struct node *next;
};
struct node *head = NULL;
struct node *current = NULL;
//Create Linked List
void insert(int data) {
// Allocate memory for new node;
struct node *link = (struct node*) malloc(sizeof(struct node));
link->data = data;
link->next = NULL;
// If head is empty, create new list
if (head == NULL) {
head = link;
return;
}
current = head;
// move to the end of the list
while (current->next != NULL)
current = current->next;
// Insert link at the end of the list
current->next = link;
}
void display() {
struct node *ptr = head;
printf("\n[head] =>");
//start from the beginning
while (ptr != NULL) {
printf(" %d =>", ptr->data);
ptr = ptr->next;
}
printf(" [null]\n");
}
void update_data(int old, int new) {
int pos = 0;
if (head == NULL) {
printf("Linked List not initialized");
return;
}
current = head;
while (current->next != NULL) {
if (current->data == old) {
current->data = new;
printf("\n%d found at position %d, replaced with %d\n", old, pos, new);
return;
}
current = current->next;
pos++;
}
printf("%d does not exist in the list\n", old);
}
int main() {
insert(10);
insert(20);
insert(30);
insert(40);
insert(50);
insert(60);
display();
update_data(40, 44);
display();
return 0;
}
执行上面程序,得到以下结果 -
[head] => 10 => 20 => 30 => 40 => 50 => 60 => [null]
40 found at position 3, replaced with 44
[head] => 10 => 20 => 30 => 44 => 50 => 60 => [null]
¥ 我要打赏
纠错/补充
收藏
加QQ群啦,易百教程官方技术学习群
注意:建议每个人选自己的技术方向加群,同一个QQ最多限加 3 个群。