单链表带表头结点（显示，多种方式插入，删除，查找，释放）

//单链表带表头结点
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

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

typedef struct node Node;
typedef Node * Link;

void display(Link head) //显示
{
Link p;
if(NULL == head)
{
printf(“no such link!\n”);
return;
}
p = head->next;
if(NULL == head->next)
{
printf(“Link is empty!\n”);
return;
}
while(NULL != p)
{
printf("%d\n",p->num);
p = p->next;
}
}

void is_malloc_ok(Link new_node)
{
if(NULL == new_node)
{
printf(“malloc error!\n”);
exit(-1);
}
}

void create_node(Link * new_node)
{
*new_node = (Link) malloc(sizeof(Node));
is_malloc_ok(*new_node);
}

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

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 p;
p = head;
while(NULL != p->next)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}

void insert_node_mid_front(Link head,Link new_node,int loc) //中间插入到结点前面
{
Link p,q;
q = head;
p = head->next;
if(p == NULL)
{
head->next = new_node;
new_node->next = NULL;
}
else
{
while(p->next!= NULL && p->num != loc)
{
q = p;
p = p->next;
}
}
if(p->num != loc&&p->next == NULL)
{
p->next = new_node;
new_node->next = NULL;
}
else
{
q->next = new_node;
new_node->next = p;
}
}

void insert_node_mid_after(Link head,Link new_node,int loc) //中间插入到结点后面
{
Link p;
p = head->next;
while(p != NULL && p->num != loc)
{
p = p->next;
}
if(p == NULL)
{
printf(“NO SUCH NODE!\n”);
return;
}
else
{
new_node->next = p->next;
p->next = new_node;
}
}

void delete_node(Link head,int num_del) //删除
{
Link p, q;
p = head;
if(p->next == NULL)
{
printf(“Link is empty!\n”);
return;
}
else
{
while(NULL != p->next && p->next->num != num_del)
{
p = p->next;
}
if(NULL == p->next)
{
printf(“no such node!\n”);
return;
}
else
{
q = p->next;
p->next = p->next->next;
free(q);
}
}
}

Link search_node(Link head,int num_search) //查找
{
Link p;
p = head->next;
if(NULL == p)
{
printf(“Link is empty!\n”);
return NULL;
}
else
{
while(p != NULL)
{
if(p->num == num_search)
{
return p;
}
p = p->next;
}
return p;
}

}

void insert_node_sort(Link head, Link new_node)
{
Link p,q;
q = head;
p = head->next;
while(p != NULL && p->num < new_node->num)
{
q = p;
p = p->next;
}
q->next = new_node;
new_node->next = p;

}

void make_empty(Link head) //清空
{
Link p = head->next;
while(p != NULL)
{
head->next = p->next;
free§;
p = head->next;
}

}

void release_link(Link * head) //释放
{
make_empty(*head);
free(*head);
*head = NULL;

}

int main()
{
Link head;
Link new_node;
int i;
int loc;
int num_del;
int num_serch;
Link p_serch;
create_link(&head);
srand((unsigned)time(NULL));
for(i = 0; i < 10;i++)
{
create_node(&new_node);
new_node->num = rand() % 100;
insert_node_sort(head,new_node);
}
display(head);
printf(“please input num to search:\n”);
scanf("%d",&num_serch);
p_serch = search_node(head,num_serch);
if(NULL == p_serch)
{
printf(“no such node!\n”);
}
else
{
printf("%d\n",p_serch->num);
}
printf("\n");
create_node(&new_node);
new_node->num = 100;
printf(“please input num to delete:\n”);
scanf("%d",&num_del);
delete_node(head,num_del);
printf("\n");
display(head);
create_node(&new_node);
new_node->num = 100;
printf(“please input loc:\n”);
scanf("%d",&loc);
insert_node_mid_front(head,new_node,loc);//从链表中找到一个数，将数字100插在它的前面，找不到这个数就插在最后
printf("\n");
display(head);
printf("\n");
make_empty(head);
display(head);
printf("\n");
release_link(&head);
display(head);
return 0;
}