2019.07.25

最新推荐文章于 2019-10-16 20:47:44 发布

qq_45386416

最新推荐文章于 2019-10-16 20:47:44 发布

阅读量85

点赞数

分类专栏：作业

本文链接：https://blog.csdn.net/qq_45386416/article/details/97307796

版权

作业专栏收录该内容

12 篇文章 0 订阅

订阅专栏

1.带表头的链表

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.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 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->next = NULL;

   /* p = head->next;
    if((head -> next) == NULL)
    {
        head->next = 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(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 = new_node;
        new_node -> next = NULL;
    }
    else
    {
        q->next = new_node;
        new_node -> next = p;
    }

}

void insert_node_sort(Hlink head,Hlink new_node)
{
    Hlink p,q;
    p = head->next;
    q = head;

    while(p != NULL && (p->num)<new_node->num)
    {
        q = p;
        p = p->next;
    }
    new_node->next = p;
    q->next = new_node;
}

void delete_link(Hlink head,int d)
{
    Hlink p,q;
    p = q = head;
    if(p->num == d)
    {
        p = p->next;
        free(p);
        p = q = head;
    }
    else
    {   
        while(p != NULL && p->num != d)
        {
            q = p;
            p = p->next;
        }
        if(p)
        {
            q->next = p->next;
            free(p);
        }
        else
        {
            printf("can not find the number!\n");
            return;
        }
    }
}

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

void release_link(Hlink *head)
{
    Hlink p;

    release_node(*head);
    p = *head;
    *head = (*head)->next;
    free(p);
}

void display_link(Hlink head)
{
    Hlink p;
    if(head == NULL)
    {
        printf("no such link!\n");
        return;
    }


    p = head->next;

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

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

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

    srand((unsigned)time(NULL));

    int i;
    int loc;
    int d;
    
    create_link(&head);

    for(i  = 0;i < 10;i++)
    {
        create_node(&new_node);

       // new_node->num = rand()%100;

       // insert_node_sort(head,new_node);

        new_node->num = i + 1;

        insert_node_head(head,new_node);

        //insert_node_tail(head,new_node);
    }
    
    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);

    printf("please input a number to delete:");
    scanf("%d",&d);

    delete_link(head,d);

    display_link(head);

    release_link(&head);

   // release_node(head);

    display_link(head);

    return 0;
}

2.带表头的循环链表

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.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;
   (*head)->next = *head;
}

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

void insert_node_tail(Hlink head,Hlink new_node)
{
    Hlink p;
    p = head;

    while(p->next != head)
    {
        p = p->next;
    }
    p->next = new_node;
    new_node->next = head;

   /* p = head->next;
    if((head -> next) == NULL)
    {
        head->next = 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(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 = new_node;
        new_node -> next = head;
    }
    else
    {
        q->next = new_node;
        new_node -> next = p;
    }

}


    [n
void insert_node_sort(Hlink head,Hlink new_node)
{
    Hlink p,q;
    p = head->next;
    q = head;

    while(p != head && (p->num)<new_node->num)
    {
        q = p;
        p = p->next;
    }
    new_node->next = p;
    q->next = new_node;
}

void delete_link(Hlink head,int d)
{
    Hlink p,q;
    p = q = head;
    if(p->num == d)
    {
        p = p->next;
        free(p);
        p = q = head;
    }
    else
    {   
        while(p != NULL && p->num != d)
        {
            q = p;
            p = p->next;
        }
        if(p)
        {
            q->next = p->next;
            free(p);
        }
        else
        {
            printf("can not find the number!\n");
            return;
        }
    }
}

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

void release_link(Hlink *head)
{
    Hlink p;

    release_node(*head);
    p = *head;
    *head = (*head)->next;
    free(p);
}

void display_link(Hlink head)
{
    Hlink p;
    if(head == NULL)
    {
        printf("no such link!\n");
        return;
    }


    p = head->next;

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

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

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

    srand((unsigned)time(NULL));

    int i;
    int loc;
    int d;
    
    create_link(&head);

    for(i  = 0;i < 10;i++)
    {
        create_node(&new_node);

        new_node->num = rand()%100;

        insert_node_sort(head,new_node);

       // new_node->num = i + 1;

       // insert_node_head(head,new_node);

        //insert_node_tail(head,new_node);
    }
    
    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);*/

    printf("please input a number to delete:");
    scanf("%d",&d);

    delete_link(head,d);

    display_link(head);

    release_link(&head);

   // release_node(head);

    display_link(head);

    return 0;
}