/************************************************************************/
/* 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;
}
数据结构链表操作1
最新推荐文章于 2024-04-22 07:00:00 发布