单链表的基本操作

╰+哭是因爲堅強的太久メ 2022-10-17 04:24 175阅读 0赞

# 单链表的基本操作 #

实验环境:visual studio2019

### 代码实现 ###

#include <stdio.h>
    #include <stdlib.h>
    #include <malloc.h>
    #define _CRT_SECURE_NO_WARNINGS
    
    typedef struct node { 
        int data;
        struct node* next;
    }LinkList;
    
    LinkList* head;
    LinkList* s;
    
    LinkList* Create_LinkList() { 
        int ix;
        LinkList* head, * p;
        head = (LinkList*)malloc(sizeof(LinkList));
        if (head == NULL) { 
            return head;
        }
        head->next = NULL;
        printf("请输入数据直到输入0结束:\n");
        scanf_s("%d", &ix);
        while (ix != 0) { 
            p = (LinkList*)malloc(sizeof(LinkList));
            p->data = ix;
            p->next = head->next;
            head->next = p;
            scanf_s("%d", &ix);
        }
        return (head);
    }
    
    int Print_LinkList(LinkList* head) { 
        LinkList* p = head->next;
        if (p == NULL) { 
            return 0;
        }
        while (p != NULL) { 
            printf("%d\t", p->data);
            p = p->next;
        }
        return 1;
    }
    
    LinkList* GetData_LinkList(LinkList* head, int i) { 
        LinkList* p;
        int j = 0;
        if (i <= 0) { 
            return NULL;
        }
        p = head;
        while (p->next != NULL && j < i) { 
            p = p->next;
            j++;
        }
        if (i == j) { 
            return p;
        }
        else { 
            return NULL;
        }
    }
    
    void InsertAfter_LinkList(LinkList* p, int i) { 
        LinkList* s;
        s = (LinkList*)malloc(sizeof(LinkList));
        s->data = i;
        s->next = p->next;
        p->next = s;
    
    }
    
    int DeleteAfter_LinkList(LinkList* p) { 
        LinkList* r;
        if (!p)return 0;
        r = p->next;
        if (!r) { 
            return 0;
        }
        p->next = r->next;
        free(r);
        return 1;
    }
    
    int main() { 
        int i = 0, j = 0;
        LinkList* p;
        head = Create_LinkList();
        Print_LinkList(head);
        printf("\n请输入查询的位置:");
        scanf_s("%d", &i);
        p = GetData_LinkList(head, i);
        printf("%d", p->data);
        printf("\n请输入后插位置:");
        scanf_s("%d", &j);
        p = GetData_LinkList(head, j);
        printf("\n请输入插入的信息:");
        scanf_s("%d", &i);
        InsertAfter_LinkList(p, i);
        Print_LinkList(head);
        printf("\n输入要后删位置:");
        scanf_s("%d", &i);
        p = GetData_LinkList(head, i);
        DeleteAfter_LinkList(p);
        Print_LinkList(head);
        return 0;
    }

### 效果图 ###

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1NjcxNzMy_size_16_color_FFFFFF_t_70]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1NjcxNzMy_size_16_color_FFFFFF_t_70]: /images/20221014/2ef357e945534f22976ccd9836c2d0c1.png