苏嵌学习日志7月24日

学习日志             姓名：石圆圆        日期：2018年7月24日

[code]#include <stdio.h>
#include <stdlib.h>

enum RESULT
{
NO =  -1,
SUCCESE,
FAIL,
DELATE_SUCCESE,
DELATE_FAIL,
RESERVE_SUCCESE,
RESERVE_FAIL
};

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

typedef struct node Node;
typedef Node * Link;

void creat_link(Link *head)
{
*head = NULL;
}

void insert_head_node(Link newnode,Link *head)
{
if(newnode != NULL)
{
newnode->next = *head;
*head = newnode;
}
else
{
newnode->next == NULL;
*head = newnode;
}
}

int insert_mid_node(Link newnode,Link *head,int num)
{
if(*head == NULL)
{
return NO;
}

Link temp = *head;
while(temp != NULL)
{
if(temp->num == num)
{
newnode->next = temp->next;
temp->next = newnode;
return SUCCESE;
}
temp = temp->next;
}
return FAIL;
}

void insert_tail_node(Link newnode,Link *head)
{
if(*head == NULL)
{
newnode->next = NULL;
*head = newnode;
}
else
{
Link temp = *head;
while(temp->next != NULL)
{
temp = temp->next;
}
temp->next = newnode;
newnode->next = NULL;
}
}

int delate_node(Link *head,int num)
{
if(*head == NULL)
{
return NO;
}

Link temp = *head;

if((*head)->num == num)
{
(*head) = (*head)->next;
free(temp);
temp = NULL;
return DELATE_SUCCESE;
}
else
{
Link p = temp;
temp = temp->next;

while(temp != NULL)
{
if(temp->num == num)
{
p->next = temp->next;
free(temp);
temp = NULL;
return DELATE_SUCCESE;
}
p = temp;
temp = temp->next;
}
}
return DELATE_FAIL;
}

int reserve_link(Link *head)
{
if(*head == NULL||(*head)->next == NULL)
{
return RESERVE_FAIL;
}

Link p = *head;
Link s = p->next;
Link t = s->next;

while(t != NULL)
{
s->next = p;
p = s;
s = t;
t = t->next;
}
s->next = p;
(*head)->next = NULL;
*head = s;
return RESERVE_SUCCESE;
}

void display_link(Link *head)
{
Link temp = *head;

while(temp != NULL)
{
printf("%d\n",temp->num);
temp = temp->next;
}
}

int main()
{
int i;
Link head;
Link newnode;

creat_link(&head);

for(i = 0;i < 10;i++)
{
newnode = (Link)malloc(sizeof(Node));
newnode->num = i + 1;
// insert_head_node(newnode,&head);
//insert_mid_node(newnode,&head,6);
insert_tail_node(newnode,&head);
}

display_link(&head);

delate_node(&head,3);

reserve_link(&head);
/*
newnode = (Link)malloc(sizeof(Node));
newnode->num = 11;

insert_mid_node(newnode,&head,5);
*/
display_link(&head);

return 0;
}