一、链表的创建和链表遍历算法的演示(要用C++跑,有些写法在C下会报错)
#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 create_list(void);
void traverse_list(PNODE pHead);
int main(void)
{
PNODE pHead = NULL; //等价于struct Node *pHead =NULL
pHead = create_list(); //创建一个非循环单链表,并将该链表的头结点的地址赋给pHead
traverse_list(pHead); //遍历
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");
return;
}
二、在上一个基础上加了链表是否为空的判断和求其长度
#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 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; //等价于struct Node *pHead =NULL
pHead = create_list(); //创建一个非循环单链表,并将该链表的头结点的地址赋给pHead
traverse_list(pHead); //遍历
int len = length_list(pHead);
printf("链表的长度是%d\n", len);
/* 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");
return;
}
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;
}
PS 算法:
狭义的算法是与数据的存储方式密切相关;
广义的算法是与数据的存储方式无关;
泛型:
利用某种技术达到的效果是:不同的存储方式,执行的操作是一样的;
三、此程序有增加了排序功能
#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 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; //等价于struct Node *pHead =NULL
pHead = create_list(); //创建一个非循环单链表,并将该链表的头结点的地址赋给pHead
traverse_list(pHead); //遍历
int len = length_list(pHead);
printf("链表的长度是%d\n", len);
sort_list(pHead);
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");
return;
}
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;
}
四、增加了删除和插入功能
#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 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; //等价于struct Node *pHead =NULL
pHead = create_list(); //创建一个非循环单链表,并将该链表的头结点的地址赋给pHead
traverse_list(pHead); //遍历
/*
insert_list(pHead,4,33);
traverse_list(pHead);
*/
/*
if(delete_list(pHead, 4, &val))
{
printf("成功,元素是:%d", val);
}
else
{
printf("失败!\n");
}
traverse_list(pHead);
*/
int len = length_list(pHead);
printf("链表的长度是%d\n", len);
sort_list(pHead);
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");
return;
}
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;
}
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节点后面的节点
p->pNext = p->pNext ->pNext ;
free(q);
q = NULL;
return true;
}