数据结构-链表

#include <stdio.h>
//#incldue <malloc.h>
#include <string.h>
#include <stdlib.h>
typedef struct Node {
int data;//数据域
struct Node *pNext;//指针域
}NODE,PNODE;//NODE 等价于struct Node，PNODE等价于struct Node

PNODE create_list(int num)
{
int i;
PNODE pTail;//关键是在于pTail是可以移动的,永远指向最后一个节点
PNODE pNew;

PNODE pHead = (PNODE)malloc(sizeof(NODE));
if( pHead == NULL)
	return NULL;
pTail = pHead;//刚开始pTail也执行头节点
pTail->pNext = NULL;//用户输入0时只有一个头节点，头结点的后继为空
for(i = 0; i < num; i++) {
	pNew = (PNODE)malloc(sizeof(NODE));
	if(pNew == NULL)
	 printf("malloc pNew fail\n");
	pNew->data = i;
	pTail ->pNext = pNew;
	pTail = pNew;
}

return pHead;

}

void traverse_list(PNODE pHead)
{
PNODE pMov = pHead->pNext;
//while(pMov->pNext != NULL) {//pMov已经是头结点的下一个节点 所以这里这样处理是有问题的
while(pMov != NULL) {
printf("%d",pMov->data);
pMov = pMov->pNext;
}
printf("\n");
return;
}

void insert_list_h(PNODE pHead,int num)//num的后面插入
{
PNODE pMov,pNew;
int i;
pMov = pHead;
for(i = 0; i < num; ) { //6 0 num -1就可以从前面插入
pMov = pMov->pNext;
++i;
}
printf(“pMov->data = %d\n”,pMov->data);
pNew = (PNODE)malloc(sizeof(NODE));
pNew->data = 10;
if(pNew == NULL)
printf(“pNew maloc fial\n”);
pNew->pNext = pMov->pNext;
pMov->pNext = pNew;
}

void delete_list(PNODE pHead,int num)
{
PNODE pMov,pIns;
int i;
pMov = pHead;
for(i = 0; i < num;) { //0 1 2 3 4
pMov = pMov->pNext;
++i;
}
pIns = pMov->pNext;
pMov->pNext = pIns->pNext;
free(pIns);
pIns = NULL;
}

void sort_list(PNODE pHead, int val)
{
//PNODE pMov1 = pHead->pNext;
//PNODE pMov2 = pMov1->pNext;
PNODE pMov1;
PNODE pMov2;
int i = 0;
int j = 0;
int t;

for(pMov1 = pHead->pNext, i = 0; i < val - 1; pMov1 = pMov1->pNext, i++) {
	for(pMov2 = pMov1->pNext, j = i + 1; j < val; pMov2 = pMov2->pNext, j++) {
		if((pMov1->data) < (pMov2->data)) {
			t = pMov1->data;
			pMov1->data = pMov2->data;
			pMov2->data = t;
		
		}	 
	}
}

}

int length_list(PNODE pHead)
{
PNODE pMov = pHead->pNext;
int j = 0;
while(pMov != NULL) {
pMov = pMov->pNext;
++j;
}
printf(“list number is %d\n”,j);
return j;
}
void main(void)
{
PNODE pHead = NULL;//等价于 struct Node *pHead = NULL; 头指针
int num = 0;
int val;
printf(“pilease inpout num:”);
scanf("%d",&num);
pHead = create_list(num); //创建一个非循环单链表，并将该链表的头结点的地址赋给pHead
if(pHead == NULL)
printf(“creat pHead fail\n”);
traverse_list(pHead);
printf(“please input want inster number:”);
scanf("%d",&num);
insert_list_h(pHead,num);
traverse_list(pHead);
delete_list(pHead, num);
printf("\n");
traverse_list(pHead);
val = length_list(pHead);
sort_list(pHead,val);
traverse_list(pHead);
}