链表的创建、插入、删除、输出-CSDN博客

本文链接：https://blog.csdn.net/weixin_46498855/article/details/134861626

#include <bits/stdc++.h>
#include <malloc.h>
#define NULL 0
#define LEN sizeof(struct student)
struct list1
{
    int num;
    struct list1 *next;
};

struct list1 *creat()
{
    struct list1 *head,*p,*q;
    head = (struct list1 *)malloc(sizeof(struct list1));
    p = head;
    while(1)
    {
        q = (struct list1 *)malloc(sizeof(struct list1));
        scanf("%d",&q -> num);
        if(q->num == 0)
            break;
        else
        {
            p -> next = q;
            p = q;
        }
    }
    p -> next = NULL;
    return head;
}

void insert1(struct list1 *head, int m)
{
    struct list1 *p, *q, *r;
    p = head;
    q = p -> next;
    r = (struct list1 *)malloc(sizeof(struct list1));
    r -> num = m;
    while(q != NULL)
    {
        if(m > q -> num)
        {
            p = q;
            q = q ->next;
        }
        else
            break;
    }
    p -> next = r;
    r -> next = q;
}

void delete1(struct list1 *head, int n)
{
    struct list1 *p, *q;
    p = head;
    q = p ->next;
    while(q != NULL)
    {
        if(q -> num == n)
        {
            p -> next = q -> next;
            free(q);
            break;
        }
        else
        {
            p = q;
            q = q -> next ;
        }
        if(q == NULL)
            printf("未找到元素");
    }
}


void print(struct list1 *head)
{
    struct list1 *p;
    p = head -> next;
    while(p != NULL)
    {
        printf("%d",p -> num);
        p = p ->next;
    }
}

int main()
{
    int m, n;
    struct list1 *a, *b;
    a = creat();
    print(a);
    scanf("%d",&m);
    insert1(a, m);
    print(a);
    scanf("%d",&n);
    delete1(a, n);
    print(a);
}