单链表

 

#ifndef _LINKLIST_H
#define _LTNKLIST_H

#define FAILURE  10000
#define SUCCESS  10001
#define TRUE     10002
#define FALSE    10003

typedef int ElemType;

struct node
{
    ElemType data;
    struct node *next;
};

typedef struct node Node;

int LinkInit(Node **l);
int LinkInsert(Node *l,int n,ElemType e);
int LinkTraverse(Node *l,void(*p)(ElemType));
int LinkLength(Node *l);
int LinkEmpty(Node *l);
int GetElem(Node *l,int p,ElemType *e);
int LocateElem(Node *l,ElemType e,int (*p)(ElemType,ElemType));
int LinkDelete(Node *l,int p,ElemType *e);
int LinkClear(Node *l);
int LinkDestroy(Node **l);
int LinkReverse(Node *l);

#endif

#include"LinkList.h"
#include<stdio.h>

void print(ElemType e)
{
    printf(" %d ",e);
}

int equal(ElemType e1,ElemType e2)
{
    return (e1==e2)?TRUE:FALSE;
}

int main()
{
    int ret,i;
    Node *first=NULL;
    srand(time(NULL));

    ret=LinkInit(&first);
    if(ret==FAILURE)
    {
        printf("Init Failure!\n");
    }
    else
    {
        printf("Init Success!\n");
    }

    for(i=0;i<10;i++)
    {
        ret=LinkInsert(first ,i+1,rand()%20);
        if(ret==FAILURE)
        {
            printf("Insert Failure!\n");
        }
        else
        {
            printf("Insert Success!\n");
    
        }
    }
    ret=LinkTraverse(first,print);
    if (ret==FAILURE)
    {
        printf("\nTraverse Failure!\n");
    }
    else
    {
        printf("\nTraverse Success!\n");
    }

    ret=LinkReverse(first);
    if(ret==SUCCESS)
    {
        printf("Reverse Success!\n");
    }
    else
    {
        printf("Reverse Failure!\n");
    }

    ret=LinkTraverse(first,print);
    if (ret==FAILURE)
    {
        printf("\nTraverse Failure!\n");
    }
    else
    {
        printf("\nTraverse Success!\n");
    }

    ret=LinkLength(first);
    if(ret==FAILURE)
    {
        printf("Get Length Failyre!\n");
    }
    else
    {
        printf("length %d\n",ret);
    }

        ret=LinkEmpty(first);

        if(ret==TRUE)
        {
            printf("List is empty!\n");
        }
        else if(ret ==FALSE)
        {
            printf("List is not empty!\n");
        }

        int p=10;
        ElemType e;
        ret=GetElem(first,p,&e);
        if(ret ==FAILURE)
        {
            printf("Get element failure\n");
        }
        else
        {
            printf("the %dth element is %d\n ",p,e);
        }

        e=10;
        ret=LocateElem(first,e,equal);
        if(FAILURE==ret)
        {
            printf("%d not exist \n",e);
        }
        else
        {
            printf("%d is %dth element\n",e,ret);
        }
        

        p=3;
        ret=LinkDelete(first,p,&e);

        if(ret==FAILURE)
        {
            printf("Delete Failure!\n");
        }
        else
        {
            printf("Delete %d Success!\n");
        }

        ret=LinkTraverse(first,print);

        if(ret==FAILURE)
        {
            printf("\nTraverse Failure!\n");
        }
        else
        {
            printf("\nTraverse Success!\n");
        }

        ret=LinkClear(first);
        {
            if(ret==SUCCESS)
            {
                printf("Clear Success!\n");
            }
            else
            {
                printf("Clear Failure!\n");
            }
        }

        ret=LinkTraverse(first,print);
        if(ret==FAILURE)
        {
            printf("\nTraverse Failure!\n");
        }
        else
        {
            printf("\nTraverse Success!\n");
        }
        
        ret=LinkDestroy(&first);
        if(ret==SUCCESS)
        {
            printf("Destroy Success!\n");
        }
        else
        {
            printf("Destroy Failure!\n");
        }
    

        return 0;
}

 

#include"LinkList.h"
#include<stdlib.h>
#include<stdio.h>


int LinkInit(Node **l)
{
    *l=(Node*)malloc(sizeof(Node)*1);  //分配头结jiedian  l就是头指针
    if(NULL==*l)
    {
        return FAILURE;
    }
    (*l)->next=NULL;   //头结点指针为空.

    return SUCCESS;
}

int LinkInsert(Node *l,int n,ElemType e)
{
    Node *p=l;
    int k=1;

    if(NULL==l)
    {
        return FAILURE;
    }

    while(k<n&&p!=NULL)
    {
        p=p->next;
        k++;
    }

    if(k>n||p==NULL)
    {
        return FAILURE;
    }

    Node *q=(Node*)malloc (sizeof(Node)*1);
    if(NULL==q)
    {
        return FAILURE;
    }

    q->data=e;
    q->next=p->next;
    p->next=q;

    return SUCCESS;
}

int LinkTraverse(Node *l,void(*p)(ElemType))
{
    if(NULL==l)
    {
        return FAILURE;
    }
    Node *q=l;

    while(q->next)
    {
        q=q->next;
        p(q->data);
    }

    return SUCCESS;
}

int LinkLength(Node *l)
{
    if(NULL==l)
    {
        return FAILURE;
    }
    int len=0;
    Node *p=l->next;

    while(p)
    {
        len++;
        p=p->next;
    }
    return len;
}

int LinkEmpty(Node *l)
{
    return (l->next==NULL)?TRUE:FALSE;
}

int GetElem(Node *l,int p,ElemType *e)
{
    if(NULL ==l ||p<1)
    {
        return FAILURE;
    }

    Node *q=l;
    int i;

    for(i=0;i<p&&q!=NULL;i++)
    {
        q=q->next;
    }

    if(!q)
    {
        return FAILURE;
    }

    *e=q->data;

    return SUCCESS;
}


int LocateElem(Node *l,ElemType e,int (*p)(ElemType,ElemType))
{
    if(NULL==l)
    {
        return FAILURE;
    }

    Node *q=l->next;
    int len=1;

    while(q)
    {
        if(p(e,q->data)==TRUE)
        {
            return len;
        }
        q=q->next;
        len++;
    }
    return FAILURE;
}

int LinkDelete(Node *l,int p,ElemType *e)
{
    int k=1;
    Node *q=l;

    if(l==NULL)
    {
        return FAILURE;
    }

    while (k<p&&q!=NULL)
    {
        q=q->next;
        k++;
    }

    if(k>p||q==NULL)
    {
        return FAILURE;
    }
    Node *n=q->next;
    *e=n->data;
    q->next=n->next;
    free(n);
}

int LinkClear(Node *l)
{
    if(NULL==l)
    {
        return FAILURE;
    }

    Node *p=l->next;

    while(p)
    {
        l->next=p->next;
        free(p);
        p=l->next;
    }
    return SUCCESS;
}

int LinkDestroy(Node **l)
{
    if(l==NULL)
    {
        return FAILURE;
    }
    free(*l);
    (*l)=NULL;

    return SUCCESS;
}

int LinkReverse (Node *l)
{
    if(NULL==l)
    {
        return FAILURE;
    }

    Node *p=l->next;
    l->next=NULL;
    
    while(p!=NULL)
    {
        Node *q=p;
        p=p->next;
        q->next=l->next;
        l->next=q;
    }

    return SUCCESS;
}