数据结构-链表的基本操作 【简洁版本题解】

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
//list definition
typedef struct Node
{
    int data;
    struct Node *next;
}Node, *Linkedlist;
//list initialization
Linkedlist listInit()
{
    Node *L;
    L = (Node *)malloc(sizeof(Node));
    if(L == NULL)
    {
        printf("List initialization failed");
        exit(0);
    }
    L->next = NULL;
    return L;
}
//list creation by Head_Insert
Linkedlist listCreatH(Linkedlist L, int n)
{
    int x;
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &x);
        Node *p = (Node *)malloc(sizeof(Node));
        p->data = x;
        p->next = L->next;
        L->next = p;
    }
    return L;
}
Linkedlist listInsert(Linkedlist L, int rank, int x)
{
    Node *p = L;
    for(int i = 1; i < rank; i++) p = p->next;
    if(p == NULL)
    {
        printf("insert fail\n");
        return 0;
    }
    Node *s = (Node *)malloc(sizeof(Node));
    s->data = x;
    s->next = p->next;
    p->next = s;
    printf("insert OK\n");
    return L;
}
Linkedlist listDelete(Linkedlist L, int rank)
{
    if(L->next == NULL)
    {
        printf("delete fail\n");
        return 0;
    }
    Node *pre = L, *p;
    for(int i = 1; i < rank; i++) pre = pre->next;
    p = pre->next;
    pre->next = p->next;
    free(p);
    printf("delete OK\n");
    return L;
}
void listGet(Linkedlist L, int rank)
{
    if(L->next == NULL)
    {
        printf("get fail\n");
        return;
    }
    Node *p = L;
    for(int i = 0; i < rank; i++) p = p->next;
    printf("%d\n", p->data);
}
void listShow(Linkedlist L)
{
    Node *p = L->next;
    if(p == NULL) printf("Link list is empty\n");
    else
    {
        while(p)
        {
            printf("%d ", p->data);
            p = p->next;
        }
        printf("\n");
    }
}
int main ()
{
    Node *L;
    L = listInit();
    int num, operate_num, rank, insert_value;
    scanf("%d", &num);
    L = listCreatH(L, num);
    scanf("%d", &operate_num);
    char operate_name[10];
    for(int i = 0; i < operate_num; i++)
    {
        scanf("%s", &operate_name);
        if(strcmp(operate_name, "get") == 0)
        {
            scanf("%d", &rank);
            listGet(L, rank);
        }
        else if(strcmp(operate_name, "insert") == 0)
        {
            scanf("%d %d", &rank, &insert_value);
            listInsert(L, rank, insert_value);
        }
        else if(strcmp(operate_name, "delete") == 0)
        {
            scanf("%d", &rank);
            listDelete(L, rank);
        }
        else if(strcmp(operate_name, "show") == 0)
        {
            listShow(L);
        }
    }
    return 0;
}