带头结点的循环单链表

使用中间插入方法先找到合适的位置，然后插到链表中，可以按要求排序并输出

/*****************************************************

copyright (C), 2014-2015, Lighting Studio. Co.,     Ltd. 
File name：
Author:fhb    Version:0.1    Date: 
Description：
Funcion List: 
*****************************************************/


#include <stdio.h>
#include<stdlib.h>
#include<time.h>


typedef struct node
{
    int num;
struct node * next;
}Node;


typedef struct node * Link;


void malloc_ok(Link * new_node)
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
printf("creat error!\n");
exit(-1);
}
}


void create_link(Link * head)
{
malloc_ok(head);
(*head)->next = *head;
}


void insert_node_head(Link  head,Link new_node)
{
new_node->next = head->next;
head->next = new_node;
}


void insert_node_tail(Link  head,Link new_node)
{
Link tmp = head->next;


if(head->next == head)
{
new_node->next = head->next;
head->next = new_node;
}
else
{
while(tmp->next != head)
{
tmp = tmp->next;
}
tmp->next = new_node;
new_node->next = head;
}
}


Link find(Link head,int n)
{
    Link tmp = head;
while(tmp->next != head && tmp->num != n)
{
tmp =tmp->next;
}
if(tmp == head&&tmp->num != n)
{
printf("can't find this data!\n");
return NULL;
}
else
{
return tmp;
}
}


void display_link(Link head)
{
Link tmp = head->next;
if(head->next == head)
{
printf("the link is empty!\n");
return;
}
while(tmp->next != head)
{
printf("num=%d\n",tmp->num);
tmp = tmp->next;
}
printf("num=%d\n",tmp->num);
}




/*void delete(Link head,int n)
{
Link front = NULL;
    Link tmp = (head)->next;
while(tmp->num != n&&tmp->next != head)
{
front = tmp;
tmp = tmp->next;
}


    if(tmp == head&&tmp->num == n)
{
*head = tmp->next;
front->next = *head;
free(tmp);
}
else
{
   while(front->next->num != tmp->num)
   {
    front = front->next;
   }
        front->next = tmp->next;
free(tmp);
}
}*/


void remove_all(Link head)
{
Link tmp = head->next;
Link p = tmp;


if(head->next == head)
{
printf("the link is empty!\n");
return;
}


while(tmp->next != head)
{
        tmp = tmp->next;
free(p);
p = tmp;
}


head->next = head;
free(tmp);


printf("delete success!\n");
}


/*void insert_node_mid(Link *head,Link *new_node,int n)
{
Link p1 = NULL;
Link p2 = NULL;
Link tail = *head;


p1 = *head;


if(*head == NULL)
{
(*new_node)->next = *new_node;
        *head = *new_node;
}
else
{
while(tail->next != *head)
{
tail = tail->next;
}
while((p1->num < n)&&(p1->next != *head))
{
p2 =p1;
p1 = p1->next;
}
if(p1 == *head)
{
if(p1->num > n)
{
    (*new_node)->next = *head;
tail->next = *new_node
*head = *new_node;
}
else
{
(*head)->next = *new_node;
(*new_node)->next = *head;
}
}
else
{
if(p1->next == *head)
{
if(p1->num > n)
{
(*new_node)->next = p1;
p2->next =*new_node;
}
else
{
p1->next = *new_node;
(*new_node)->next = *head;
}
}
else
{
(*new_node)->next = p1;
p2->next = *new_node;
}
}
}
}*/


void insert_node_mid(Link head,Link *new_node,int n)
{
    Link p1 = NULL;
Link p2 = NULL;
Link tail = NULL;


p1 = head;
tail = head;
    
if(head == NULL)
{
(*new_node)->next = head;
head->next = *new_node;
return;
}
while(tail->next != head)
{
tail = tail->next;
}
if(head->next->num > n)
{
(*new_node)->next = head->next;
head->next = *new_node;
return;
}
while(p1->num < n&&p1->next != head)
{
p2 = p1;
p1 = p1->next;
}
if(p1->next == head)
{
tail->next = *new_node;
(*new_node)->next = head;
}
else
{
p2->next = *new_node;
(*new_node)->next = p1;
}
}


void revers_link(Link head)
{
Link p1 = NULL;
Link p2 = NULL;
Link p3 = NULL;


p3 = head->next;


if(p3 == head)
{
printf("the link is emtpy!\n");
return;
}


p2 = p3->next;
if(p2 == head)
{
return;
}


p1 = p2->next;
if(p1 == head)
{
        p2->next = p3;
p3->next = p1;
head->next = p2;
return;
}


while(p1->next != head)
{
p2->next = p3;
p3 = p2;
p2 = p1;
p1 = p1->next;
}
p2->next = p3;
p1->next = p2;
head->next->next = head;
head->next = p1;
return;
}


int main()
{
int i;


Link new_node = NULL;
    Link head = NULL;


create_link(&head);


srand(time(NULL));


for(i = 0;i < 10;i++)
{
        malloc_ok(&new_node);
// new_node->num = 10-i;
new_node->num = rand() % 100;
printf("%d ",new_node->num);
// insert_node_tail(head,new_node);
insert_node_mid(head,&new_node,new_node->num);
//  insert_node_head(head,new_node);
}
printf("\n");

// delete(head,5);


// display_link(head);
// revers_link(head);
// printf("\n");


display_link(head);




remove_all(head);


display_link(head);


    return 0;

}