C语言链表创建，删除，插入，遍历//记录

//C语言链表创建，删除，插入，遍历
//但是头节点问题没解决，记录一下

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

struct Student
{
    char name[10];
    struct Student *next;
};

int n=0;//链表长度

struct Student* creat()
{
    struct Student *head;
    struct Student *p1,*p2;
    char temp[10];
    p1=(struct Student*)malloc(sizeof(struct Student));
    scanf("%s",p1->name);
    head=p1;
    p2=p1;
    n++;
    while(1)
    {
        scanf("%s",temp);
        if(strcmp(temp,"00")==0)//00为止链表结束创建
            break;
        p1=(struct Student*)malloc(sizeof(struct Student));
       strcpy(p1->name,temp);
        p2->next=p1;
        p2=p1;
        n++;
    }
    p1->next=NULL;
    return head;
}

void display(struct Student*head)
{
    struct Student *p=head;
    while(p!=NULL)
    {
        puts(p->name);
        p=p->next;
    }
}

void del(struct Student*head,int num)
{
    struct Student*p=head;
    struct Student*q=p;
    int i;
    if(num==1&&n!=1)
    {
        p=head;
        head=head->next;
        puts(head->name);//??????
    }
    else if(num==n&&n!=1)
    {
        for(i=0;i<num-2;i++)
        {
            p=p->next;
        }

        p->next=NULL;

    }
    else if(n==1&&num==1)
    {
        head=NULL;//????/
    }
    else
    {
        for(i=0;i<num-2;i++)
        {
            p=p->next;
        }
        p->next=p->next->next;
    }
n--;
}

struct Student * insert(struct Student *head,int num,char a[])
{
    struct Student *p=head;
    struct Student *p1,*p2;
    int i;
    if(num==0)//?????
    {
        p1=(struct Student*)malloc(sizeof(struct Student));
        strcpy(p1->name,a);
        head=p1;
        p1->next=p;
    }
    else if(n==num)
    {
        for(i=0;i<num-1;i++)
        {
            p=p->next;
        }
        p1=(struct Student*)malloc(sizeof(struct Student));
        strcpy(p1->name,a);
        p->next=p1;
        p1->next=NULL;
    }
    else//mid
    {
        for(i=0;i<num-1;i++)
        {

            p=p->next;
        }
        p2=p->next;
        p1=(struct Student*)malloc(sizeof(struct Student));
        strcpy(p1->name,a);
        p->next=p1;
        p1->next=p2;

    }

 n++;
}