#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define CREATE_OK 1
#define CREATE_NO 0
#define MALLOC_OK 1
#define MALLOC_NO 0
struct node
{
int num;
struct node *next;
};
typedef struct node Node;
typedef Node * Hlink;
int is_malloc_ok(Hlink new_node) //判断是否分配成功
{
if(NULL == new_node)
{
return MALLOC_NO;
}
return MALLOC_OK;
}
int create_node(Hlink *new_node) //创建一个节点
{
*new_node = (Hlink)malloc(sizeof(Node));
if(MALLOC_OK == is_malloc_ok(*new_node))
{
return CREATE_OK;
}
return CREATE_NO;
}
int create_hlink(Hlink *head) //创建一个带头节点的链表
{
if(CREATE_OK == create_node(head))
{
(*head)->next = NULL;
return CREATE_OK;
}
return CREATE_NO;
}
void insert_node_tail(Hlink head, Hlink new_node) //尾插法
{
Hlink p = NULL;
p = head;
while(p->next != NULL)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}
void insert_node_head(Hlink head, Hlink new_node) //头插法
{
new_node->next = head->next;
head->next = new_node;
}
void insert_node_mid_front(Hlink head, Hlink new_node, int num) //中间之前插入一个节点
{
Hlink p = NULL, q = NULL;;
q = head;
p = head->next;
while (p != NULL && p->num != num)
{
q = p;
p = p->next;
}
new_node->next = p;
q->next = new_node;
}
void insert_node_mid_rear(Hlink head, Hlink new_node, int num) //中间之后插入一个节点
{
Hlink p = NULL;
p = head;
while(p->next != NULL && p->num != num)
{
p = p->next;
}
new_node->next = p->next;
p->next = new_node;
}
void insert_node_srot(Hlink head, Hlink new_node) //链表插入时排序
{
Hlink p = NULL, q = NULL;
q = head;
p = head->next;
while(p != NULL && p->num < new_node->num)
{
q = p;
p = p->next;
}
new_node->next = p;
q->next = new_node;
}
void delete_node(Hlink head, int num) //删除节点
{
Hlink p = NULL, q = NULL;
q = head;
p = head->next;
while(p != NULL && p->num != num)
{
q = p;
p = p->next;
}
if(p == NULL)
{
printf("no delete!\n");
return ;
}
q->next = p->next;
free(p);
}
void reverse_link(Hlink head) //转直链表
{
Hlink p1 = NULL, p2 = NULL, p3 = NULL;
p1 = head->next;
if(p1 == NULL)
{
printf("reverse:the hlink is NULL!\n");
return ;
}
p2 = p1->next;
if(p2 == NULL)
{
return;
}
p3 = p2->next;
while(p3 != NULL)
{
p2->next = p1;
p1 = p2;
p2 = p3;
p3 = p3->next;
}
p2->next = p1;
head->next->next = NULL;
head->next = p2;
}
Hlink seek_node(Hlink head, int num) //查找节点
{
Hlink p = NULL;
p = head->next;
while(p != NULL && p->num != num)
{
p = p->next;
}
if(p == NULL)
{
printf("seek:is not!\n");
return NULL;
}
else
{
return p;
}
}
int count_link_long(Hlink head) //计算表长
{
int count = 0;
Hlink p = NULL;
p = head->next;
while(p != NULL)
{
p = p->next;
count++;
}
return count;
}
void display_hlink(Hlink head) //遍历链表
{
Hlink p = NULL;
if(NULL == head)
{
printf("no such hlink!\n");
return ;
}
else if (head->next == NULL)
{
printf("the hlink is NULL!\n");
return ;
}
else
{
p = head->next;
while(p != NULL)
{
printf("%d\n", p->num);
p = p->next;
}
}
}
void make_empty(Hlink head) //清空链表
{
Hlink p = NULL;
p = head->next;
if(p == NULL)
{
printf("make_empty:the hlink is NULL!\n");
return ;
}
while(p != NULL)
{
head->next = p->next;
free(p);
p = head->next;
}
}
void release_hlink(Hlink *head) //释放链表
{
make_empty(*head);
free(*head);
*head = NULL;
}
int main()
{
Hlink head = NULL;
Hlink new_node = NULL;
int i;
int num;
int count;
srand((unsigned)time(NULL));
if(CREATE_NO == create_hlink(&head)) //创建一个带头节点的链表(是否成功)
{
return 0;
}
for(i = 0; i < 10; i++)
{
if(CREATE_OK == create_node(&new_node))
{
new_node->num = rand()%100;
//new_node->num = i + 1;
//insert_node_tail(head, new_node); //尾插法
//insert_node_head(head, new_node); //头插法
insert_node_srot(head, new_node); //链表插入时排序
}
}
display_hlink(head); //遍历链表
#if 0 //在已有的链表中插入节点
printf("please insert of number:\n");
scanf("%d", &num);
if(CREATE_OK == create_node(&new_node))
{
printf("please input node num:\n");
scanf("%d", &new_node->num);
insert_node_mid_front(head, new_node, num); //中间之前插入一个节点
//insert_node_mid_rear(head, new_node, num); //中间之后插入一个节点
}
display_hlink(head); //遍历链表
#endif
#if 0 //删除链表的节点
printf("please delete node number:\n");
scanf("%d", &num);
delete_node(head, num); //删除节点
printf("delete after:\n");
display_hlink(head); //遍历链表
#endif
#if 0 //链表转至
reverse_link(head); //转直链表
printf("the hlink reverse is:\n");
display_hlink(head); //遍历链表
#endif
#if 0
Hlink p = NULL;
printf("the node number is:");
scanf("%d", &num);
p = seek_node(head, num); //查找节点
if(p != NULL)
{
printf("seek node is:");
printf("%d\n", p->num);
}
#endif
#if 1
printf("the hlink long is:");
count = count_link_long(head); //计算表长
printf("%d\n", count);
#endif
make_empty(head); //清空链表
display_hlink(head); //遍历链表
release_hlink(&head); //释放链表
display_hlink(head); //遍历链表
return 0;
}