单链表-增删等功能

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>

typedef struct Node{
	int data;//数据域
	struct Node * pNext; //指针域 
}NODE, *PNODE; //NODE <=> struct Node, *PNODE <=> struct Node *

//函数声明
PNODE creat_list(); 
void traverse_list(PNODE pHead);
bool is_empty(PNODE pHead);
int length_list(PNODE pHead);
bool insert_list(PNODE pHead, int pos, int val);
bool delete_list(PNODE pHead, int pos, int *pVal);
void sorted_list(PNODE pHead);
 
int main(){
	
	PNODE pHead = NULL; // <=> struct Node * pHead = NULL;
	int val;
	pHead = creat_list(); //creat_list() :创建一个非循环单链表，并将该链表的头结点的地址赋给pHead
	 
	//int length = length_list(pHead);
	//printf("链表的有效长度为：%d", length);
	//sorted_list(pHead);
	traverse_list(pHead);// 遍历
	//insert_list(pHead, -4 , 33);
	if(delete_list(pHead, 3, &val)){
		printf("删除成功！\n");
		printf("删除的值为：%d\n", val); 
	}else{
		printf("删除失败！\n");
	}
	traverse_list(pHead);
//	if(is_empty(pHead)){
//		printf("链表为空！"); 
//	}else{
//		printf("链表不空！");
//	}
	return 0;
}

//创建 
PNODE creat_list(){
	int len; //用来存放有效节点的个数 
	int i;
	int val; //用来临时存放用户输入的节点的值  
	
	//分配了一个不存放有效数据的头结点 
	PNODE pHead = (PNODE)malloc(sizeof(NODE));
	if(NULL == pHead){
		printf("分配失败，程序终止！");
		exit(-1); 
	}
	
	//pTail永远指向尾节点 
	PNODE pTail = pHead;
	pTail->pNext = NULL;
	
	printf("请输入您需要生成的链表节点的个数：");
	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("分配失败，程序终止！");
		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 sorted_list(PNODE pHead){
	int i, j, t;
	PNODE p, q;
	int len = length_list(pHead);
	
	for(i = 0, p = pHead->pNext; i < len -1 ; i++,p = p->pNext){
		for(q = p->pNext; j < len; j++,q = q->pNext){
			if(p->data > q->data){ //类似于 a[i] > a[j] 
				t = p->data; //类似于：t = a[i]; 
				p->data = q->data;//类似于：a[i] =a[j]; 
				q->data = t; //类似于：a[j] = t 
			}
		}
	}
	
	return ;
}

//在pHead所指向链表的第pos个节点的前面插入一个新的节点，该节点的值为val，并且pos的值从1开始 
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("动态分配内存失败！");
		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){
		return false;
	}
	
	PNODE q = p->pNext;
	*pVal = q->data;
	
	//删除p后面的结点 
	p->pNext = p->pNext->pNext;
	free(q);
	q = NULL;
	
	return true;
}