编程学习网为您整理以下代码实例，主要实现：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");
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", item);
}
int main() {
insert(10);
insert(20);
insert(30);
insert(1);
insert(40);
insert(56);
find_data(56);
return 0;
}
本站部分内容来源互联网,如果有图片或者内容侵犯您的权益请联系我们删除！