第三十九次发博不知道发什么好

怎么感觉好几天没打卡，手都生疏了.....

#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
}slist;

slist * creatfront(slist *L,int a[],int n)
{    int i;
    slist *s;
    for(i=0;i<n;i++)
    {
        s=(slist*)malloc(sizeof(slist));
        s->data=a[i];
        s->next=L->next;
        L->next=s;
    }
    return L;
}

void creatlater(slist *L,int a[],int n)
{
    slist *p=L,*s;
    int i;
    for(i=0;i<n;i++)
    {
        s=(slist*)malloc(sizeof(slist));
        s->data=a[i];
        s->next=p->next;
        p->next=s;
        p=s;    
    }
}

void insert(slist *L,int i,int x)
{
    int j=0;
    slist *p=L,*s;
    while(p!=NULL&&j<i-1)
    {
        j++;
        p=p->next;
    }
    s=(slist*)malloc(sizeof(slist));
    s->data=x;
    s->next=p->next;
    p->next=s; 
}

int  delet(slist *L,int x,int i)
{
    int j=0;
    slist *p;
    while(L!=NULL&&j<i)
    {
        j++;
        L=L->next;
    }
    if(L==NULL)
    return i;
    else
    {
        p=L->next;
        L->next=p->next;
        free(p);
    }
        return 1;        
}

int length(slist *L)
{
    int n;
    while(L!=NULL)
    {
        n++;
        L=L->next;
    }
        return n;
}

void destroy(slist *L)
{
    slist *pre=L,*p=L->next;
    while(p!=NULL)
    {
        free(pre);
        pre=p;
        p=p->next;
    }
        free(pre);
}

void print(slist *L)
{
    slist *p=L;
    while(p!=NULL)
    {
        scanf("%d",p->data);
        p=p->next;
    }
}

int findlocation(slist *L,int x,int *e)
{
    int i,j;
    slist *p=L;
    while(p->next!=NULL)
    {
        p=p->next;
        i++;    
    }
    if(p->data==x)
    {
        *e=i;
        e++;
        j++;
    }
        return j;
        
}