创建一个循环链表,并查找循环链表中的数据项的示例程序,将以下代码保存到一个源文件中:find_item_in_circular_linked_list.c, 如下所示 -
#include
#include
struct node {
int data;
struct node *next;
};
struct node *head = NULL;
struct node *current = 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;
}
//display the list
void find_data(int item) {
int pos = 0;
if (head == NULL) {
printf("Linked List not initialized \n");
return;
}
current = head;
while (current->next != head) {
if (current->data == item) {
printf("%d found at position %d\n", item, pos);
return;
}
current = current->next;
pos++;
}
if (current->data == item) {
printf("%d found at position %d\n", item, pos);
return;
}
printf("%d does not exist in the list\n", item);
}
int main() {
insert(10);
insert(20);
insert(30);
insert(40);
insert(50);
insert(60);
find_data(56);
find_data(60);
return 0;
}
执行上面程序,得到以下结果 -
56 does not exist in the list
60 found at position 5
¥ 我要打赏
纠错/补充
收藏
加QQ群啦,易百教程官方技术学习群
注意:建议每个人选自己的技术方向加群,同一个QQ最多限加 3 个群。