#include<stdio.h>
#include"Linklist.h"
void print(ElemType e)
{
printf("%d",e);
}
int equal(ElemType e1, ElemType e2)
{
return (e1 == e2) ? TRUE : FALSE;
}
int main()
{
srand(time(NULL));
int ret, i;
Node *first = 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() % 10);
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 == FAILURE)
{
printf("\nReverse Failure!\n");
}
else
{
printf("\nReverse Success!\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 Failure!\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 = 3;
ElemType e;
ret = Getelem(first, p, &e);
if(ret == FAILURE)
{
printf("Get element failure!n\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);
}
ret = LinkDestroy(&first);
if(ret == SUCCESS)
{
printf("Destroy Success!\n");
}
else
{
printf("Destroy Failure!\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");
}
}
return 0;
}
#include<stdlib.h>
#include"Linklist.h"
int Linkinit(Node **l)
{
*l = (Node *)malloc(sizeof(Node)*1);
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 0;
}
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 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;
}
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)
{
Node *q = l;
int k = 1;
if(NULL == l)
{
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);
return SUCCESS;
}
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(NULL == l)
{
return FAILURE;
}
free(*l);
(*l) = NULL;
return SUCCESS;
}
#ifndef _LINKLIST_H
#define _LINKLIST_H
#define FAILURE 10000
#define SUCCESS 10001
#define FALSE 10002
#define TRUE 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 Getelem(Node *l, int p, ElemType *e);
int Linkempty(Node *l);
int LocateElem(Node *l, ElemType e, int (*p)(ElemType,ElemType));
int LinkDelete(Node *l, int p, ElemType *e);
int LinkReverse(Node *l);
int LinkDestroy(Node **l);
int Linkclear(Node *l);
#endif