數據結構鏈表操作1

/************************************************************************/
/* 2013年4月8日19:40:12                                                                     */
/************************************************************************/
#include <Stdio.h>
#include <malloc.h>
#include <stdlib.h>

typedef struct Node
{
	int data;//數據域
	struct Node * pNext;//指針域
}NODE,*PNODE;

PNODE create_list(void);//創建
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,int *);//刪除一個
void sort_list(PNODE);//排序

int main(void)
{
	PNODE pHead = NULL;

	pHead =create_list();//創建一個非循環單鏈表
	traverse_list(pHead);

	int len = length_list(pHead);
	printf("鏈表的長度爲:%d\n",len);
	
	insert_list(pHead,4,33);


	sort_list(pHead);
	printf("排序之後的鏈表\n");
	traverse_list(pHead);

	if (is_empty(pHead))
		printf("鏈表爲空!\n");
	else
		printf("鏈表不爲空!\n");

	return 0;
}

PNODE  create_list(void)
{
	int len;//用來存放有效節點的個數
	int i;
	
	int val;//用阿里臨時存放用戶輸入的節點的值

	PNODE pHead = (PNODE)malloc(sizeof(NODE));
	if(NULL == pHead)
	{
		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 (NULL == pNew)
		{
			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( NULL != p)
	{
		printf("%d ",p->data);
		p = p->pNext;
	}
	printf("\n");
}

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

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

	return len;
}

void sort_list(PNODE pHead)
{
	int i,j,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;
			}
		}
	}

	return;
}

//在pHead所指向的鏈表的第pos個節點的前面插入一個新的節點，節點的值是val
bool insert_list(PNODE pHead,int pos,int val)
{
	int i = 0;
	PNODE p = pHead;

	while (NULL != p && i<pos-1)
	{
		p=p->pNext;
		++i;
	}
	if(i>pos-1 || NULL == p)
		return false;

	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if (NULL == pNew)
	{
		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 *pVal)
{
	int i = 0;
	PNODE p = pHead;
	
	while (NULL != p->pNext && i<pos-1)
	{
		p=p->pNext;
		++i;
	}
	if(i>pos-1 || NULL == p->pNext)
		return false;
	
	PNODE q = p->pNext;
	*pVal = q->data;
	p->pNext=p->pNext->pNext;
	free(p);
	q=NULL;
	
	return true;
}