数据删除c语言程序,C语言删除循环链表中的数据项程序

创建一个循环链表，并删除循环链表中的数据项的示例程序，将以下代码保存到一个源文件中：remove_item_in_circular_linked_list.c， 如下所示 -

#include

#include

struct node {

int data;

struct node *next;

};

struct node *head = NULL;

struct node *current = NULL;

struct node *prev = NULL;

//insert link at the first location

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;

head->next = link;

return;

}

current = head;

// move to the end of the list

while (current->next != head)

current = current->next;

// Insert link at the end of the list

current->next = link;

// Link the last node back to head

link->next = head;

}

void remove_data(int data) {

int pos = 0;

if (head == NULL) {

printf("Linked List not initialized");

return;

}

if (head->data == data) {

if (head->next != head) {

current = head;

while (current->next != head) {

current = current->next;

}

current->next = head->next;

head = head->next;

return;

}

else {

head = NULL;

printf("List is empty\n");

exit(0);

}

}

else if (head->data != data && head->next == NULL) {

printf("%d not found in the list\n", data);

return;

}

current = head;

while (current->next != head && current->data != data) {

prev = current;

current = current->next;

}

if (current->data == data) {

prev->next = prev->next->next;

free(current);

}

else

printf("%d not found in the list.", data);

}

//display the list

void printList() {

struct node *ptr = head;

printf("\n[head] =>");

//start from the beginning

while (ptr->next != head) {

printf(" %d =>", ptr->data);

ptr = ptr->next;

}

printf(" %d =>", ptr->data);

printf(" [head]\n");

}

int main() {

insert(10);

insert(20);

insert(30);

insert(40);

insert(50);

insert(60);

printf("Original List -");

printList();

remove_data(20);

printf("List after removal -");

printList();

return 0;

}

执行上面程序，得到以下结果 -

Original List -

[head] => 10 => 20 => 30 => 40 => 50 => 60 => [head]

List after removal -

[head] => 10 => 30 => 40 => 50 => 60 => [head]

¥ 我要打赏

纠错/补充

收藏

加QQ群啦，易百教程官方技术学习群

注意：建议每个人选自己的技术方向加群，同一个QQ最多限加 3 个群。