建立一個迴圈連結串列,並查詢回圈連結串列中的資料項的範例程式,將以下程式碼儲存到一個原始檔中:find_item_in_circular_linked_list.c, 如下所示 -
#include <stdio.h>
#include <stdlib.h>
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