#include stdio.h#include stdlib.hstruct node {int data;struct node *next;};struct node *head = NULL;

编程学习网为您整理以下代码实例，主要实现：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 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(1);
   insert(40);
   insert(56); 

   printList();
   return 0;
}