2019.07.23

链表初体验

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

struct node
{
    int num;
    char name[30];
    char sex;
    int age;
    char add[30];
    struct node *next;
};

typedef struct node Node;
typedef struct node* Link;

void is_malloc_ok(Link new_node)
{
    if(new_node == NULL)
    {
        printf("malloc error\n");
        exit(-1);
    }
}

void create_node(Link *new_node)
{
    *new_node = (Link)malloc(sizeof(Node));
    is_malloc_ok(*new_node);
}


void insert_node_tail(Link *head,Link new_node)/*尾插*/
{
    Link p;

    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 insert_node_mid(Link *head,Link new_node,int loc)
{
    Link p,q;
    p = q = *head;
    if((*head) -> num == loc)
    {
        new_node -> next = *head;
        *head = new_node;
    }
    else
    {
        while((p != NULL) && p -> num != loc)
        {
            q = p;
            p = p -> next;
        }
        if(p == NULL)
        {
            q -> next = new_node;
            new_node -> next = NULL;
        }
        else
        {
            q -> next = new_node;
            new_node -> next = p;
        }
    }
}

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

void  insert_node_head(Link *head,Link new_node)/*头插*/
{
    new_node -> next = *head;
    *head = new_node;
}

void release_link(Link *head)/*释放内存空间*/
{
    Link p;
    p = *head;

    while(*head != NULL)
    {
        *head = (*head)-> next;
        free(p);
        p = *head;
    }
}

void display_link(Link head)
{
    Link p;
    p = head;

    if(head == NULL)
    {
        printf("link is empty!\n");
        return ;
    }

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

int main()
{
    Link head = NULL;
    Link new_node = NULL;

    create_link(&head);

    int i;
    int loc;

    for(i = 0;i < 10;i++)
    {
       // new_node = (Link)malloc(sizeof(Node));
        create_node(&new_node);

        new_node -> num = i + 1;

       // insert_node_head(&head,new_node);/*头插*/
       insert_node_tail(&head,new_node);/*尾插*/

     //  display_link(tail);
    }

    display_link(head);

    create_node(&new_node);

    printf("please input a number for new_node:");
    scanf("%d",&new_node -> num);

    printf("please input a number for insert location:");
    scanf("%d",&loc);

    insert_node_mid(&head,new_node,loc);
    display_link(head);

    release_link(&head);

    display_link(head);

    return 0;
}