学习日志 上课190725

带表头结点的链表

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

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

typedef struct head_node Hnode;
typedef struct head_node * Hlink;

void is_malloc_ok(Hlink node)
{
    if (node == NULL)
    {
        printf("malloc error!\n");
        exit(-1);
    }
}

void create_node(Hlink * node)
{
    *node = (Hlink)malloc(sizeof(Hnode));
    is_malloc_ok(*node);
}

void create_link(Hlink * head)
{
    create_node(head);
    (*head)->next = NULL;
}

void insert_node_head(Hlink head,Hlink new_node)
{
    new_node->next = head->next;
    head->next = new_node;
}

void display_link(Hlink head)
{
    Hlink p;
    p = head->next;

    if ((head->next) == NULL)
    {
        printf("link is empty!\n");
        return;
    }
    while (p != NULL)
    {
        printf("%d\n",p->num);
        p = p->next;
    }

}

void insert_node_tail(Hlink head, Hlink new_node)
{
    Hlink p;
    p = head;
    
        while (p->next != NULL)
        {
            p = p->next;
        }
        p->next = new_node;
        new_node = NULL;
    
}

void insert_node_mid(Hlink head,Hlink new_node,int loc)
{
    Hlink p, q;
    p = q = head;
    while (p != NULL && p->num != loc)
    {
        q = p;
        p = p->next;
    }
    if (p == NULL)
    {
        q->next = NULL;
        new_node = NULL;
    }
    else
    {
        q->next = new_node;
        new_node->next = p;
    }


}

void free_link(Hlink head)
{
    Hlink p;
    p = head->next;
    while(head->next != NULL)
    {
        head->next = p->next;
        free(p);
        p = head->next;
    }
}

void release_link(Hlink *head)
{
    free_link(*head);
    (*head)->next = NULL;
}


int main()
{
    Hlink head;
    Hlink new_node;
    int i,loc;
    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_link(head);

    printf("\n");
    create_node(&new_node);
    printf("Please input a number for new_node :\n");
    scanf("%d",&new_node->num);

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

    insert_node_mid(head,new_node,loc);
    display_link(head);
   // free_link(head);
    release_link(&head);
    display_link(head);
    return 0;
}