#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node * Link;
int is_malloc_ok(Link new_node)
{
if(new_node == NULL)
{
printf("MALLOC ERROR!\n");
return 0;
}
else
{
return 1;
}
}
void create_node(Link * new_node)
{
int count = 10;
do
{
*new_node = (Link)malloc(sizeof(Node));
count--;
}while(!is_malloc_ok(*new_node) && count);
}
void create_link(Link * head)
{
create_node(head);
(*head)->next = NULL;
}
void insert_node_head(Link head,Link new_node)
{
Link p = head;
new_node->next = p->next;
p->next = new_node;
}
void insert_node_tail(Link head,Link new_node)
{
Link p = head;
while(p->next != NULL)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}
void insert_node_mid_before(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->num != loc && p->next != NULL)
{
q = p;
p = p->next;
}
}
if(p->next == NULL && p->num != loc)
{
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)
{
Link p = head;
Link q;
if(p->next == NULL)
{
printf("Link is empty!\n");
return;
}
else
{
while(p->next != NULL && p->next->num != num)
{
p = p->next;
}
if(p->next == NULL)
{
printf("NO SUCH NODE\n");
return;
}
else
{
q = p->next;
p->next = p->next->next;
free(q);
}
}
}
int length_link(Link head)
{
Link p = head->next;
int count = 0;
while(p != NULL)
{
count++;
p = p->next;
}
return count;
}
Link find_node(Link head,int num)
{
Link p = head->next;
if(p == NULL)
{
printf("NO LINK!\n");
return;
}
else
{
while(p != NULL)
{
if(p->num == num)
{
return p;
}
p = p->next;
}
return p;
}
}
void display(Link head)
{
Link p = head;
if(p->next == NULL)
{
printf("No Link!\n");
return;
}
else
{
p = p->next;
while(p != NULL)
{
printf("num = %d\n",p->num);
p = p->next;
}
}
}
void make_link_empty(Link head)
{
Link p = head->next;
if((head)->next == NULL)
{
printf("Link is empty!\n");
return;
}
else
{
while((head)->next != NULL)
{
head->next = p->next;
free(p);
p = head->next;
}
}
}
void release_link(Link * head)
{
Link p = *head;
while(*head != NULL)
{
*head = (*head)->next;
free(p);
p = *head;
}
}
int main()
{
Link head;
Link new_node;
int i;
int number;
int location;
create_link(&head);
for(i = 0;i < 10;i++)
{
create_node(&new_node);
new_node->num = i + 1;
insert_node_head(head,new_node);
//insert_node_tail(head,new_node);
}
display(head);
printf("The length of Link is:%d\n",length_link(head));
printf("Input a number you wanna find:\n");
scanf("%d",&number);
p = find_link(head,number);
if(p == NULL)
{
printf("no such node!\n");
}
else
{
printf("p = %d\n",p->num);
}
create_node(&new_node);
printf("Input a number you to be deleted:\n");
scanf("%d",&number);
delete_node(head,number);
display(head);
printf("The length of Link is:%d\n",length_link(head));
printf("Input a number for new_node:\n");
scanf("%d",&new_node->num);
printf("Input a location for new_node:\n");
scanf("%d",&location);
//insert_node_mid_before(head,new_node,location);
insert_node_mid_after(head,new_node,location);
display(head);
printf("The length of Link is:%d\n",length_link(head));
make_link_empty(head);
display(head);
release_link(&head);
if(head == NULL)
{
printf("release ok!\n");
}
return 0;
}