链表的实现

定义一个链表

typedef struct Node
{
	int data;
	struct Node * pNext;
}NODE,* PNODE;

声明方法

PNODE create_list(void);
void traverst_list(PNODE);
bool is_empty(PNODE);
bool insert_list(PNODE,int val,int pos);  //指在第pos个元素后面插入本值
bool delete_list(PNODE,int pos,int * val);   //指在删除第pos个元素，并把值传给val
void sort_list(PNODE);
int length_list(PNODE);

int main()
{
	int value;
	int select;
	PNODE pHead;
	pHead = create_list();
	traverst_list(pHead);
	printf("%d\n",length_list(pHead));
	sort_list(pHead);
	traverst_list(pHead);
	while(true)
	{
		printf("--------选择插入还是删除----------------\n");
		printf("插入请选1，删除请选2：");
		scanf("%d",&select);
		if(select == 1)   //插入
		{
			int pos;
			int val;
			printf("请输入要插入的元素位置和数值：");
			scanf("%d %d",&pos,&val);
			if(insert_list(pHead,val,pos))
			{
				printf("插入成功\n");
			} 
			else
			{
				printf("插入失败\n");
			}
			traverst_list(pHead);
		}
		else     //删除
		{
			int pos;
			printf("请输入要删除的元素位置：");
			scanf("%d",&pos);
			if(delete_list(pHead,pos,&value))
			{
				printf("删除的元素是：%d\n",value);
			}
			else
				printf("删除失败！\n");
			traverst_list(pHead);
		}	
	}
	
	traverst_list(pHead);
	return 0;
}

创建链表

PNODE create_list(void)
{
	int len;
	int i;
	int val;

	printf("请输入链表元素个数：len= ");
	scanf("%d",&len);
	PNODE pHead = (PNODE)malloc(sizeof(NODE));
	pHead->pNext = NULL;
	PNODE pTail = pHead;

	for(i=0;i<len;i++)
	{
		printf("请输入第%d个元素：",i+1);
		scanf("%d",&val);
		PNODE pNew = (PNODE)malloc(sizeof(NODE));
		pNew->data = val;
		pNew->pNext = NULL;
		pTail->pNext = pNew;
		pTail = pNew;
	}
	return pHead;
}

遍历链表

void traverst_list(PNODE pHead)
{
	PNODE p = pHead->pNext;
	while(p!=NULL)
	{
		printf("%d ",p->data);
		p=p->pNext;
	}
	printf("\n");
}

判断是不是空

bool is_empty(PNODE pHead)
{
	if(pHead->pNext!=NULL)
		return true;
	else
		return false;
}

排序链表

void sort_list(PNODE pHead)
{
	int i,j;
	int t;
	int len = length_list(pHead);
	PNODE p,q;
	for(i=0,p=pHead->pNext;i<len-1;i++,p=p->pNext)
		for(j=i+1,q=p->pNext;j<len;j++,q=q->pNext)
		{
			if(p->data>q->data)
			{
				t=p->data;
				p->data=q->data;
				q->data=t;
			}
		}
}

插入节点

bool insert_list(PNODE pHead,int val,int pos)  //指在第pos个元素后面插入本值
{
	PNODE p = pHead;
	int i=0;
	while(p!=NULL && i<pos)
	{
		i++;
		p = p->pNext;
	}
	if(i>pos || p==NULL)
		return false;
	PNODE pNEW = (PNODE)malloc(sizeof(NODE));
	if(pNEW == NULL)
	{
		printf("分配失败程序停止！");
		exit(-1);
	}
	pNEW->data = val;
	pNEW->pNext = p->pNext;
	p->pNext = pNEW;
	return true;
}

删除节点

bool delete_list(PNODE pHead,int pos,int * val)  //指在删除第pos个元素，并把值传给val
{
	PNODE p = pHead;
	int i=0;
	while(p!=NULL && i<pos-1)
	{
		i++;
		p = p->pNext;
	}
	if(i>pos-1 || p==NULL)
		return false;
	PNODE q = p->pNext;
	* val = q->data;
	p->pNext = q->pNext;
	free(q);

	return true;
}

统计链表长度

int length_list(PNODE pHead)
{
	int count=0;
	PNODE p = pHead->pNext;
	while(p!=NULL)
	{
		count++;
		p=p->pNext;
	}
	return count;
}