链表实现

#ifndef HEAD_H__
#define HEAD_H__
#include<stdlib.h>

#define ERROR 0
#define OK 1
#define FALSE 0
#define TRUE 1
typedef int status;
typedef int boolean;
typedef int ElementType;
#define MAX 100

void view(ElementType *);
status compare(ElementType ,ElementType);
void buildSet(ElementType a[],int length,int beg,int end);
void printSet(ElementType a[],int length);

#endif

#ifndef LINKLIST_H__
#define LINKLIST_H__

#include"head.h"

struct linkNode{
	ElementType elem;
	struct linkNode *next;
};

typedef struct linkNode *linkList;

status initLinkList(linkList *L);
status destroyLinkList(linkList *L);
status clearLinkList(linkList L);
status empty(linkList L);
int length(linkList L);
status getElement(linkList L,int i,ElementType *e);
int locateElement(linkList L,ElementType e,status (*compare)(ElementType ,ElementType));
status priorElement(linkList L,ElementType cur_e,ElementType *pre_e);
status priorElement1(linkList L,ElementType cur_e,ElementType *pre_e);
status nextElement(linkList L,ElementType cur_e,ElementType *next_e);
status myInsert(linkList L,int i,ElementType e);
status myDelete(linkList L,int i,ElementType *e);
status myTraverse(linkList L,void (*view)(ElementType *));

#endif

#include"head.h"
#include<stdio.h>
#include<stdlib.h>
#include<time.h>

void view(ElementType *e)
{
	printf("%d\t",*e);
}

status compare(ElementType e1,ElementType e2)
{
	if(e1==e2)
		return TRUE;
	else
		return FALSE;
}

void buildSet(ElementType a[],int length,int beg,int end)
{
	int i;

	srand((unsigned)time(NULL));
	for(i=0;i<length;i++)
		a[i]=rand()%(end-beg+1)+beg;
}

void printSet(ElementType a[],int length)
{
	int i,count=1;
	
	for(i=0;i<length;i++,count++)
	{
		printf("%d\t",a[i]);
		if(count%10==0)
			printf("\n");
	}
}

#include"linkList.h"

status initLinkList(linkList *L)
{
	*L=(linkList)malloc(sizeof(struct linkNode));
	if(!*L)
		exit(1);
	(*L)->next=NULL;
	//(*(*L)).next=NULL;注意，此处定义的*L是指向指针类型linkList的指针。即**L才是linkNode。
	return OK;
}

status destroyLinkList(linkList *L)
{
	linkList q;
	while(*L)
	{
		q=(*L)->next;
		free(*L);
		*L=q;
	}
	return OK;
}

status clearLinkList(linkList L)
{
	linkList p,q;

	p=L->next;
	while(p)
	{
		q=p->next;
		free(p);
		p=q;
	}
	L->next=NULL;
	return OK;
}

status empty(linkList L)
{
	if(L->next)
		return FALSE;
	else
		return TRUE;
}

int length(linkList L)
{
	int i=0;
	linkList p=L->next;
	
	while(p)
	{
		++i;
		p=p->next;
	}
	return i;
}

status getElement(linkList L,int i,ElementType *e)
{
	linkList p=L->next;
	int j=1;
	
	while(j<i && p)
	{
		p=p->next;
		j++;
	}
	if(!p && j>i)
		return ERROR;
	*e=p->elem;
	return OK;
}

int locateElement(linkList L,ElementType e,status (*compare)(ElementType ,ElementType))
{
	linkList p=L->next;
	int count=1;
	while( p && !compare(p->elem,e))
	{
		p=p->next;
		count++;
	}
	if(p)
		return count;
	else 
		return 0;
}

status priorElement(linkList L,ElementType cur_e,ElementType *pre_e)
{
	linkList q,p=L->next;

	while(p->next)
	{
		q=p->next;
		if(q->elem==cur_e)
		{
			*pre_e=p->elem;
			return OK;
		}
		p=q;
	}
	return FALSE;
}
status priorElement1(linkList L,ElementType cur_e,ElementType *pre_e)
{
	linkList p=L->next;
	while(p->next->elem!=cur_e)
		p=p->next;
	if(p)
	{
		*pre_e=p->elem;
		return OK;
	}
	else
		return FALSE;
}

status nextElement(linkList L,ElementType cur_e,ElementType *next_e)
{
	linkList p=L->next;
	while(p->next)
	{
		if(p->elem==cur_e)
		{
			*next_e=p->next->elem;
			return OK;
		}
		p=p->next;
	}
	return FALSE;
}

status myInsert(linkList L,int i,ElementType e)
{
	int j=0;
	linkList q,p=L;//注意这里支持在第一个节点之前插入元素，故p指向头结点。

	while(p &&  j<i-1)//p=p->next故只需要将下标运行到i-2号位置即可，退出循环则指向i-1.
	{
		p=p->next;
		j++;
	}
	if(!p || j>i-1)
		return ERROR;
	q=(linkList)malloc(sizeof(struct linkNode));
	q->elem=e;
	q->next=p->next;
	p->next=q;
	return OK;
}

status myDelete(linkList L,int i,ElementType *e)
{
	int j=0;
	linkList q,p=L;
	while(p->next && j<i-1)
	{
		p=p->next;
		j++;
	}
	if(!p->next || j>i-1)
		return ERROR;
	q=p->next;
	*e=q->elem;
	p->next=q->next;
	free(q);
	return OK;
}

status myTraverse(linkList L,void (*view)(ElementType *))
{
	linkList p=L->next;
	
	while(p)
	{
		view(&(p->elem));
		p=p->next;
	}
	return OK;
}

#include<stdio.h>
#include"head.h"
#include"linkList.h"

/*
status initLinkList(linkList *L);
status destroyLinkList(linkList *L);
status clearLinkList(linkList L);
status empty(linkList L);
int length(linkList L);
status getElement(linkList L,int i,ElementType *e);
int locateElement(linkList L,ElementType e,status (*compare)(ElementType ,ElementType));
status priorElement(linkList L,ElementType cur_e,ElementType *pre_e);
status priorElement1(linkList L,ElementType cur_e,ElementType *pre_e);
status nextElement(linkList L,ElementType cur_e,ElementType *next_e);
status myInsert(linkList L,int i,ElementType e);
status myDelete(linkList L,int i,ElementType *e);
status myTraverse(linkList L,void (*view)(ElementType *));
*/

int main()
{
	ElementType a[MAX],e,pre_e,next_e;
	int i,index;
	linkList L;

	buildSet(a,MAX,0,100);
	if(initLinkList(&L))
		printf("the initialize of linkList\n");
	printf("the head node of the linkList is :%d\n",L->next);

	if(empty(L))
		printf("the linkList is empty\n");

	for(i=0;i<MAX;i++)
		myInsert(L,1,a[i]);

	myTraverse(L,view);

	printf("the linkList's length is : %d\n",length(L));

	printf("get the first 20th element and print them in reverse order\n");
	for(i=1;i<=20;i++)
	{
		getElement(L,20-i+1,&e);
		printf("%d\t",e);
	}
	printf("\n");

	index=locateElement(L,55,compare);
	getElement(L,index,&e);
	printf("the index of 55 is : %d and the element is %d\n",index,e);

	priorElement(L,55,&pre_e);
	printf("the 55's previous element is %d\n",pre_e);

	nextElement(L,55,&next_e);
	printf("the 55's next element is %d\n",next_e);

	for(i=1;i<20;i++)
	{
		myDelete(L,1,&e);
		printf("%d\t",e);
	}


	return 0;
}