释放链表内存
void release_link(Link * head)
{
Link p;
p = *head;
if(p == NULL)
{
printf("link is empty!\n");
}
else
{
while(*head != NULL)
{
*head = (*head)->next;
free(p);
p = *head;
}
}
}
使链表反序【重要】
void link_reverse(Link * head)
{
Link p1,p2,p3;
p1 = p2 = p3= *head;
if(p1 == NULL)
{
printf("Link is empty!\n");
}
else if(p1->next == NULL)
{
printf("Link is only one.\n");
}
else
{
p2 = p1->next;
if(p2->next == NULL)
{
p2->next = p1;
p1->next = NULL;
*head = p2;
}
else
{
p3 = p2->next;
while(p3->next != NULL)
{
p2->next = p1;
p1 = p2;
p2 = p3;
p3 = p3->next;
}
p2->next = p1;
p3->next = p2;
(*head)->next = NULL;
*head = p3;
}
}
}
带表头结点的链表
创建+头插+尾插+中间插入+删除+反序
#include <stdio.h>
#include <stdlib.h>
#define MAL_ERR 0
#define MAL_OK 1
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
int malloc_ok(Link new_node) //判断空间是否创建成功
{
if(new_node == NULL)
{
return MAL_ERR;
}
else
{
return MAL_OK;
}
}
void create_node(Link * new_node, int i) //创建空间
{
(*new_node) = (Link)malloc(sizeof(Node));
while(malloc_ok(*new_node) == MAL_ERR)
{
(*new_node) = (Link)malloc(sizeof(Node));
}
(*new_node)->num = i;
}
void create_link(Link * head) //创建带表头结点的链表
{
create_node(head,0);
(*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(p->next != NULL)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}
void insert_node_mid(Link head,Link new_node,int num_loc) //中间插入
{
Link p,q;
q = head;
p = head->next;
if(p == NULL)
{
head->next = new_node;
new_node->next = NULL;
}
else
{
while(p->num != num_loc && p->next != NULL)
{
q = p;
p = p->next;
}
}
if(p->next == NULL && p->num != num_loc)
{
p->next = new_node;
new_node->next = NULL;
}
else
{
q->next = new_node;
new_node->next = p;
}
}
void display(Link head) //打印链表
{
Link p;
p = head;
if(p == NULL)
{
printf("no fine Link\n");
}
if(p->next == NULL)
{
printf("Link is empty!\n");
}
else
{
while(p->next != NULL)
{
p = p->next;
printf("num = %d\n",p->num);
}
}
}
void node_del(Link head,int num_val) //删除一个数
{
Link p,q;
q = head;
p = head->next;
if(p == NULL)
{
printf("链表为空!\n");
}
else
{
while(p->num != num_val && p->next != NULL)
{
q = p;
p = p->next;
}
if(p->next == NULL && p->num != num_val)
{
printf("没有找到数。\n");
}
else
{
q->next = p->next;
free(p);
}
}
}
void link_reverse(Link head) //反转链表
{
Link p1,p2,p3,q;
p1 = p2 = p3 = head->next;
if(p1 == NULL)
{
printf("Link is empty!\n");
return;
}
else if(p1->next == NULL)
{
return;
}
else
{
p2 = p1->next;
if(p2->next == NULL)
{
p2->next = p1;
p1->next = NULL;
head->next = p2;
}
else
{
p3 = p2->next;
while(p3->next != NULL)
{
p2->next = p1;
p1 = p2;
p2 = p3;
p3 = p3->next;
}
p2->next = p1;
p3->next = p2;
q = head->next;
q->next = NULL;
head->next = p3;
}
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int num_val,num_loc;
create_link(&head);
for(i = 0; i < 10; i++)
{
create_node(&new_node,i);
insert_node_head(head,new_node);
}
display(head);
printf("请输入要插入的位置。\n");
scanf("%d",&num_loc);
printf("请输入要插入的数。\n");
scanf("%d",&num_val);
create_node(&new_node,num_val);
insert_node_mid(head,new_node,num_loc);
display(head);
printf("请输入要删除的数。\n");
scanf("%d",&num_val);
node_del(head,num_val);
display(head);
printf("*********\n");
link_reverse(head);
display(head);
return 0;
}
循环链表
创建+头插+尾插+中间插入+删除+反序+释放内存
#include <stdio.h>
#include <stdlib.h>
#define MAL_OK 1
#define MAL_ERR 0
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
int malloc_ok(Link new_node) //判断空间是否创建成功
{
if(new_node == NULL)
{
return MAL_ERR;
}
else
{
return MAL_OK;
}
}
void create_node(Link * new_node, int i) //创建空间
{
(*new_node) = (Link)malloc(sizeof(Node));
while(malloc_ok(*new_node) == MAL_ERR)
{
(*new_node) = (Link)malloc(sizeof(Node));
}
(*new_node)->num = i;
}
void create_link(Link * head) //创建带表头结点的链表
{
create_node(head,0);
(*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 p;
p = head;
while(p->next != head)
{
p = p->next;
}
p->next = new_node;
new_node->next = head;
}
void insert_node_mid(Link head,Link new_node,int num_loc) //中间插入
{
Link p,q;
q = head;
p = head->next;
if(p == head)
{
head->next = new_node;
new_node->next = head;
}
else
{
while(p->num != num_loc && p->next != head)
{
q = p;
p = p->next;
}
if(p->next == head && p->num != num_loc)
{
p->next = new_node;
new_node->next = head;
}
else
{
q->next = new_node;
new_node->next = p;
}
}
}
void display(Link head)
{
Link p;
p = head;
if(p == NULL)
{
printf("no Link.\n");
}
else if(p->next == head)
{
printf("Link is empty.\n");
}
else
{
while(p->next != head)
{
p = p->next;
printf("num = %d\n",p->num);
}
}
}
void node_del(Link head,int num_val) //删除一个数
{
Link p,q;
q = head;
p = head->next;
if(p == head)
{
printf("链表为空。\n");
}
else
{
while(p->num != num_val && p->next != head)
{
q = p;
p = p->next;
}
if(p->next == head && p->num != num_val)
{
printf("没有找到数。\n");
}
else
{
q->next = p->next;
free(p);
}
}
}
void release_link(Link * head) //释放内存以免内存泄漏
{
Link p;
p = (*head)->next;
if(p == *head)
{
printf("link is empty.\n");
free(p);
*head = NULL;
}
else
{
while(p != *head)
{
(*head)->next = p->next;
free(p);
p = (*head)->next;
}
free(*head);
*head = NULL;
}
}
void link_recerse(Link head) //反转链表
{
Link p1,p2,p3,q;
p1 = p2 = p3 = head->next;
if(p1 == head)
{
printf("Link is empty.\n");
return;
}
else if(p1->next == NULL)
{
return;
}
else if(p1->next == head)
{
return;
}
else
{
p2 = p1->next;
if(p2->next == NULL)
{
p2->next = p1;
p1->next = head;
head->next = p2;
}
else
{
p3 = p2->next;
while(p3->next != head)
{
p2->next = p1;
p1 = p2;
p2 = p3;
p3 = p3->next;
}
p2->next = p1;
p3->next = p2;
q = head->next;
q->next = head;
head->next = p3;
}
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int num_val,num_loc;
create_link(&head);
for(i = 0; i < 10; i++)
{
create_node(&new_node,i);
insert_node_tail(head,new_node);
}
display(head);
printf("请输入要插入的位置。\n");
scanf("%d",&num_loc);
printf("请输入要插入的数。\n");
scanf("%d",&num_val);
create_node(&new_node,num_val);
insert_node_mid(head,new_node,num_loc);
display(head);
printf("请输入要删除的数字。\n");
scanf("%d",&num_val);
node_del(head,num_val);
display(head);
release_link(&head);
display(head);
return 0;
}