链表的使用

#include <stdio.h>
#include <stdlib.h>
 
typedef struct Node
{
	int data;
	struct Node * pNext;
}*PNODE,NODE;

PNODE create_list();
void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
int length_list(PNODE);
bool insert_list(PNODE,int,int);
bool delete_list(PNODE,int);
void sort_list(PNODE);

int main(int argc, char *argv[])
{
	PNODE pHead = NULL;
	pHead = create_list();
	if(is_empty(pHead))
		printf("链表为空！\n");
	//sort_list(pHead);
	//insert_list(pHead,2,10);
	delete_list(pHead,4);
	traverse_list(pHead);
	return 0;
}

PNODE create_list()
{
	int len,i,val;
	PNODE pHead = (PNODE)malloc(sizeof(NODE)); 
	if(pHead == NULL)
	{
		printf("分配失败！\n");
		exit(-1);
	}
	PNODE pTail = pHead;
	pTail->pNext = NULL;
	printf("len = ");
	scanf("%d",&len);
	for(i=0;i<len;i++)
	{
		printf("第%d：",i+1);
		scanf("%d",&val);
		PNODE pNew = (PNODE)malloc(sizeof(NODE)); 
		if(pNew == NULL)
		{
			printf("分配失败！\n");
			exit(-1);
		}
		pNew->data = val;
		pTail->pNext = pNew;
		pNew->pNext = NULL;
		pTail = pNew; 
	}
	return pHead;	
}

void traverse_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;
}
int length_list(PNODE pHead)
{
	int len = 0;
	PNODE p = pHead->pNext;
	while(p!=NULL)
	{
		++len;
		p = p->pNext;
	}
	return len;
}
void sort_list(PNODE pHead)
{	
	int i,j,t;
	PNODE p,q;
	int len=length_list(p);
	for(i = 0,p = pHead->pNext;i<len-1;i++,p=p->pNext)
		for(j=0,q = p->pNext;j<len-i-1;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 pos,int val)
{
	int i = 0;
	PNODE p = pHead;
	while(p!=NULL&&i<pos-1)
	{
		p=p->pNext;
		++i;
	}
	if(i>pos-1||p==NULL)
	{
		return false;
	}
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if(pNew == NULL)
	{
		printf("插入时内存分配失败！\n");
		exit(-1);
	}
	pNew->data = val;
	PNODE q = p->pNext;
	p->pNext = pNew;
	pNew->pNext = q;
	return true;
}
bool delete_list(PNODE pHead,int pos)
{
	int i = 0;
	PNODE p = pHead;
	while(p!=NULL&&i<pos-1)
	{
		p=p->pNext;
		++i;
	}
	if(i>pos-1||p->pNext==NULL)
	{
		return false;
	}
//	PNODE q = p->pNext;
	p->pNext = p->pNext->pNext;
//	free(q);
	//q=NULL;
	return true;
}