#include<stdio.h>
#include<stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node; //重命名
typedef Node * Link;
enum result_val{RET_OK = 1,RET_NO=0}; //枚举
void create_head(Link * head)
{
*head = NULL;
}
int create_node(Link * new_node)
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
return RET_NO;
}
else
{
return RET_OK;
}
}
void insert_node_tail(Link * head,Link new_node)
{
Link p = NULL;
p = *head;
if(*head == NULL)
{
*head = new_node;
new_node->next = NULL;
}
else
{
while (p->next != NULL)
{
p = p->next;
}
p->next = new_node;
new_node->next = NULL;
}
}
void display_link(Link head)
{
Link p = NULL;
p = head;
if(p == NULL)
{
printf("the link is empty !\n");
return;
}
while(p != NULL)
{
printf("%d\t",p->num);
p = p->next;
}
}
void release_link(Link * head)
{
Link p = NULL;
p = *head;
while(*head != NULL)
{
p = *head;
*head =(*head)->next;
free(p);
}
}
void insert_node_mind_behand(Link * head,Link new_node,int loc)
{
Link p = NULL;
// Link q = NULL;
p = *head;
if(*head == NULL)
{
*head = new_node;
new_node->next = NULL;
}
else
{
while(p->next != NULL && p->num != loc)
{
//q = p;
p = p->next;
}
/*if(p == *head)
{
new_node->next = p->next;
*head = new_node;
}*/
//else
{
new_node->next = p->next;
p->next =new_node;
}
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int loc;
create_head(&head);
for(i = 0;i < 10;i++)
{
if(RET_OK == create_node(&new_node))
{
new_node->num = i+1;
insert_node_tail(&head,new_node);
}
else
{
i--;
}
}
display_link(head);
printf("\n");
if(RET_OK == create_node(&new_node))
{
printf("please input the loc\n");
scanf("%d",&loc);
printf("please input the num\n");
scanf("%d",&new_node->num);
printf("\n");
insert_node_mind_behand(&head,new_node,loc);
display_link(head);
}
else
{
i--;
}
release_link(&head);
display_link(head);
}